(A) True
(B) False
(C) Some times true & sometimes false
(D) None of these
Category: Theory of Automata Mcqs
Theory of Automata Mcqs for Screening tests, Interviews, Viva and Other competitive exams. Aspirants of Lecturer Computer Science, SST Computer Science, Subject Specialist Computer Science, Data Entry operator, Computer Programmer, Computer Operator, System administrator and all other Exams can prepare their Theory of Automata Mcqs portion from here.
Which of the following is a regular language?
(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
Pumping lemma is generally used to prove that?
(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
Choose the incorrect (FALSE) statement?
(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
Which of the following is NOT a regular language?
(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
In CFG, the symbols that can’t be replaced by anything are called__.
(A) Terminal
(B) Non-Termina
(C) Production
(D) All of given
In FA, if one enters in a specific state but there is no way to leave it, then that specific state is called __.
(A) Dead State
(B) Waste Basket
(C) Davey John Locker
(D) All of these
Like TG, a PDA can also be non-deterministic?
(A) True
(B) False
(C) NA
(D) NA