Teaching HPSC Lecturer (Technical) Mock Test 2024 Theory of Computation Context Free Languages and Pushdown Automata Pushdown Automata
Consider the languages L1, L2 and L3 as given below
L1 = {0p1q0p | p, q ϵ N}
L2 = {0p1q | p, q ϵ N and p < q} and
L3 = {0p1q0r | p, q, r ϵ N and p = q = r}
Which of the following statements is NOT TRUE?
1
A DPDA can recognize L1 but not an FA
2
An NPDA can recognize L2 but not an DPDA
3
Neither NPDA nor DPDA can recognize L3
4
None of the above
5
Question Not Attempted