Gate CS-2011 Question Paper With Solutions

Q. 26 Consider the languages L1, L2 and L3 as given below.
Gate CS-2011 Question Paper With Solutions

Which of the following statements is NOt TRUE?

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

(B) L1 is a regular language

(C) All the three languages are context free

(D) Turing machines can be used to recognize all the languages

Answer: (C)

Explanation:

Gate CS-2011 Question Paper With Solutions

Learn More:   Gate ME-2013 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here