Home / Engineering / Theory of Computation and Compiler Design / Question

M

Mr. Dubey • 51.43K Points
Coach

Q.) Consider the language L1,L2,L3 as given below.
L1={0^{p}1^{q} | p,q \in N}
L2={0^{p}1^{q} | p,q \in N and p=q} L3={0^{p}1^{q}1^{r} | p,q,r \in N and p=q=r}
Which of the following statements is NOT TRUE?

(A) Push Down Automata (PDA) can be used to recognize L1 and L2
(B) L1 is a regular language
(C) All the three languages are context free
(D) Turing machine can be used to recognize all the three languages
Correct answer : Option (C) - All the three languages are context free

Share

Discusssion

Login to discuss.