-
Consider the languages, L1, L2 and L3 as given below
L1 = { 0p 1q | p, q ∈ N }
L2 = { 0p 1q | p , q ∈ N and p = q }
and L3 = { 0p 1q 0r | p , q , r ∈ N and p = q = r }
Which of the following statements is not true?
-
- Push Down Automata (PDA) can be used to recognize L1 and L2
- L1 is a regular language.
- All the three languages are context-free
- Turning machines can be used to recognize all the languages
- Push Down Automata (PDA) can be used to recognize L1 and L2
Correct Option: C
L1 = { 0p 1q | p, q ∈ N } is regular language
L2 = { 0p 1q | p, q ∈ N and p = q } is context-free language
L3 = { 0p 1q 0r | p, q, r ∈ N and p = q = r } is not context-free.
