(A) True
(B) False
(C) NA
(D) NA
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.
Let L be any infinite regular language, defined over an alphabet Σ then there exist three strings x, y and z belonging to Σ* such that all the strings of the form xy z n for n=1,2,3, … are the words in L. called Complement of L?
(A) Pumping Lemma
(B) Kleene’s theorem
(C) None of the given
(D) 1,2 both
The languages __ are the examples of non regular languages.
(A) EVEN-EVEN and PRIME
(B) PALINDROME and PRIME
(C) PALINDROME and EVEN-EVEN
(D) FACTORIAL and SQURE
Choose the incorrect statement?
(A) (a+b)*aa(a+b)* generates Regular language
(B) A language consisting of all strings over Σ=,a,b- having equal number of a’s and b’s is a regular language
(C) Every language that can be expressed by FA can also be expressed by RE
(D) None of these
The language that can be expressed by any regular expression is called a Non regular language?
(A) True
(B) False
(C) NA
(D) NA
The regular expression defining the language L1 U L2 can be obtained, converting and reducing the previous __ into a __ as after eliminating states.
(A) GTG, TG
(B) FA, GTG
(C) FA, TG
(D) TG, RE
L= language of words containing even number of a’s. Regular Expression is?
(A) (a+b)*aa(a+b)*
(B) (b+ab*a)*
(C) a+bb*aab*a
(D) (a+b)*ab(a+b)*
If L1 and L2 are two regular languages, then L1 U L2 is not a regular?
(A) True
(B) False
(C) NA
(D) NA