πŸ“Š Theory of Computation and Compiler Design
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
πŸ’¬ Discuss
βœ… Correct Answer: (C) All the three languages are context free

You must be Logged in to update hint/solution

πŸ’¬ Discussion

πŸ“Š Question Analytics

πŸ‘οΈ
1057
Total Visits
πŸ“½οΈ
2 y ago
Published
πŸŽ–οΈ
Mr. Dubey
Publisher
πŸ“ˆ
97%
Success Rate