Theory Of Computation MCQ

1:

Which of the following are not regular ?

A. String of 0's whose length is a perfect square
B. Set of all palindromes made up of 0's and 1's
C. Strings of 0's, whose length is a prime number
D. All of these
 

Answer : D

Explanation :
Strings of odd number of zeroes can be generated by the regular expression (00) *0.Pumping lemma can be used to prove the non-regularity of the other options.

Aman said: (11:18am on Wednesday 26th July 2017)
option A) it is not a regular language bcz it has infinte memory and does not contain an AP series.option B) 0^n1^n 0^nis also an palindrome but it is not regular because it need 2 unit memory for acceptance.option C) again it does not mantain AP series so it is not regular.option D is right

Write your comments here:


Report Error
 

Option: A

Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here.