GATE | CS | 2017 | Set 2 | TOC | Regular Expressions & Languages| Question 48

Last Updated :
Discuss
Comments

Consider the following languages.
L1 = {ap | p is a prime number}
L2 = {anbmc2m | n >= 0, m >= 0}
L3 = {anbnc2n | n >= 0}
L4 = {anbn | n >= 1}

Which of the following are CORRECT ?
I. L1 is context free but not regular.
II. L2 is not context free.
III. L3 is not context free but recursive.
IV. L4 is deterministic context free.

I, II and IV only

II and III only

I and IV only

III and IV only

This question is part of this quiz :

GATE-CS-2017 (Set 2),Theory of Computation GATE CS PYQ Quiz,Regular Expressions & Languages PYQ QUIZ GATE CS
Tags:
GATE
GATE CS
Theory of Computation
Share your thoughts in the comments