GATE | CS | 2007 | TOC | Context free grammar | Question 30

Last Updated :
Discuss
Comments

The language L= {0i21i | i≥0 } over the alphabet {0,1, 2} is:

not recursive

is recursive and is a deterministic CFL.

is a regular language.

is not a deterministic CFL but a CFL.

This question is part of this quiz :

Context free languages and Push-down automata,GATE-CS-2007,Theory of Computation GATE CS PYQ Quiz,Context Free Grammars & Languages PYQ QUIZ GATE CS
Tags:
Theory of Computation
GATE
GATE CS
Share your thoughts in the comments
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy