611 views
0 votes
0 votes

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

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
2
Abhisek Tiwari 4 asked Nov 6, 2018
704 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 5, 2018
962 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 ...
0 votes
0 votes
1 answer
4
hrcule asked Mar 21, 2018
663 views
Is true..? In an unambiguous grammar every string has exactly one derivation.