closed by
335 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

Related questions

0 votes
0 votes
1 answer
2
Abhisek Tiwari 4 asked Nov 6, 2018
703 views
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 ...
0 votes
0 votes
0 answers
3
Na462 asked Sep 9, 2018
606 views
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
0 votes
0 votes
0 answers
4
Na462 asked Sep 5, 2018
960 views
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 ...