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? (Solved)

1. Push Down Automata (PDA) can be used to recognize L1 and L2

2. L1 is a regular language

3. All the three languages are context free

4. Turing machine can be used to recognize all the three languages

  • c. All the three languages are context free
Subscribe Now

Get All Updates & News