GATE | CS | 2011 | TOC | Context Free Grammar | Question 26

Last Updated :
Discuss
Comments

Consider the languages L1, L2 and L3 as given below.

LI= {0P1q |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?

[GATE | CS | 2011 |]

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

L1 is a regular language

All the three languages are context free

Turing machine can be used to recognize all the three languages

This question is part of this quiz :

GATE CS 2011,Context free languages and Push-down automata,Theory of Computation GATE CS PYQ Quiz,Context Free Grammars & Languages PYQ QUIZ GATE CS,GATE||Context free language and context free grammar||Pyq(2010to2025),GATE||TOC || Pyq (2010 to2025)
Tags:
GATE
Theory of Computation
GATE CS
Share your thoughts in the comments