Gate CS-2014-1 Question Paper With Solutions

Q. 25 Which one of the following is TRUE?

(A) The language L = $an bn n $ 0. is regular.

(B) The language L a n is prime = $ n . is regular

(C) The language L = $w whas 3k + 1b’s for some k ! N with S = “a,b,. is regular

(D) The language L = “ww w ! S * with S = “0,1,, is regular.

Answer: (C)

Explanation:

Gate CS-2014-1 Question Paper With Solutions

Learn More:   Gate EE-2008 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here