Register

Push Down AUTOMATA
closed

• closed by
346 views
1 votes
1 votes
closed as a duplicate of: Push Down Automata
which PDA is more Powerful Deterministic or Non Deterministic and why?
• closed by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
2
Abhisek Tiwari 4 asked Nov 6, 2018
717 views
Push Down Automata
Consider Ldf set all languages accepted by DPDA by final state,Lef set of all languages accepted by DPDA by Empty stack Then A)Ldf proper subset of Lef. B)Ldf = Lef. C)Lef proper subset of Ldf. D)None .
Consider Ldf set all languages accepted by DPDA by final state,Lef set of all languages accepted by DPDA by Empty stack ThenA)Ldf proper subset of Lef.B)Ldf = Lef.C)Lef ...
User Avatar
0 votes
0 votes
0 answers
3
Na462 asked Sep 9, 2018
641 views
Push down automata
Consider following PDA WHICH OF FOLLOWING IS TRUE ABOUT LANGUAGE ACCEPTED BY IT ? A. Regular but infinite B. Regular but finite C. DCFL but not regular D. CFL but not DCFL
Consider following PDA WHICH OF FOLLOWING IS TRUE ABOUT LANGUAGE ACCEPTED BY IT ?A. Regular but infiniteB. Regular but finiteC. DCFL but not regularD. CFL but not DCFL
User Avatar
0 votes
0 votes
0 answers
4
Na462 asked Sep 5, 2018
984 views
Push Down Automata
Consider A given PDA as following Qo is the start state here. What is the language accepted by the given PDA ? 1. { ( bn a bn a )m | m,n ≥ 0 } 2. { ( bn a bn a )m | m,n ≥ 0 } U { bn | n ≥ 1} 3. { ( bn a bn )m . a | m,n ≥ 0 } 4. None
Consider A given PDA as following Qo is the start state here. What is the language accepted by the given PDA ?1. { ( bn a bn a )m | m,n ≥ 0 }2. { ( bn a bn a )m | m,n ...
User Avatar
Link Copied!