Tag: Theory of Automata

(A) True
(B) False
(C) Some times true & sometimes false
(D) None of these

(A) String of odd number of zeroes
(B) Set of all palindromes made up of 0’s and 1’s
(C) String of 0’s whose length is a prime number
(D) All of these

(A) A given language is infinite
(B) A given language is not regular
(C) Whether two given regular expressions of a regular language are equivalent or not
(D) None of these

(A) A Mealy machine generates no language as such
(B) A Mealy machine has no terminal state
(C) For a given input string, length of the output string generated by a Moore machine is not more than the length of the output string generated by that of a Mealy machine
(D) All of these

(A) String of 0’s whose length is a perfect squere
(B) Set of all palindromes made up of 0’s and 1’s
(C) String of 0’s whose length is a prime number
(D) All of the given options

(A) Terminal
(B) Non-Termina
(C) Production
(D) All of given

(A) Dead State
(B) Waste Basket
(C) Davey John Locker
(D) All of these

(A) True
(B) False
(C) NA
(D) NA