Register

pushdown automata

• edited by
3,126 views
0 votes
0 votes
construct pushdown automata  for the following language

1. a^nb^nc^md^m | n,m>=1

2.a^nb^mc^md^n |n,m>=1

3.a^ib^jc^kd^l | i=k or j=l
• edited by
User Avatar

1 Answer

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
3
anonymous asked Jan 16, 2019
262 views
Building a pushdown automata that receives L*
given a pushdown automata that receives L by getting to an accepting state, how can a pushdown automata be built, so that it accepts L*? (might use a “double bottom” if needed)?? i don’t know how to solve it and would appreciate any kind of help! studying for exam and must learn how to solve it
given a pushdown automata that receives L by getting to an accepting state, how can a pushdown automata be built, so that it accepts L*? (might use a “double bottom” ...
User Avatar
0 votes
0 votes
0 answers
4
Rhythm asked Jan 3, 2019
825 views
pushdown automata
what will be the pushdown automata for the language, L=a^n b^m where n=2m+1.
what will be the pushdown automata for the language, L=a^n b^m where n=2m+1.
User Avatar
Link Copied!