info@avatto.com
+91-9920808017
56. The language L = (0n 1n 2n where n > 0) is a
context free language
context-sensitive language
regular language
recursive enumerable language
Your email address will not be published. Required fields are marked *
Report
Name
Email
Website
Save my name, email, and website in this browser for the next time I comment.
Comment
57. Context-free grammar can be recognized by
finite state automation
2-way linear bounded automata
push down automata
both (B) and (C)
58. Context free language are closed under
union, intersection
union, kleene closure
intersection, complement
complement, kleene closure
59. If G = ({S}, {a}, {S -> SS), S), then language generated by G is
L (G) = φ
L(G) = an
L (G) = a*
L(G) = anban
60. GrammarS —> a,S —> A3A4 , A3 —> A1, A3, A2 ,A3 —> A1 A2, A1A2—> aA2A1 , A1a —> a A1, A2a —> aA2, A1A4 —> A4a,A2A4 —> A5a, A2A5 —> A5a,A5 —> a generates
an2
n2a
2an
none of these
Login with Facebook
Login with Google
Forgot your password?
Lost your password? Please enter your email address. You will receive mail with link to set new password.
Back to login
