(A) True
(B) False
(C) Such a language does
(D) None of the given options
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.
FA1 and FA2 are two FA’s representing two languages. Then FA3, which is sum of FA1 and FA2, will accept the strings which are?
(A) Accepted by FA1 AND FA2
(B) Accepted by FA1 OR FA2
(C) Accepted by FA1 AND/OR FA2
(D) None of the given options
FA1 corresponds to r*, then FA1 must accept __ string.
(A) Every
(B) Null
(C) Odd length
(D) Even length
a(a+b)*a+b(a+b)*b is RE for the language defined over S={a,b} having words beginning and ending with same letters?
(A) True
(B) False
(C) Such a language is not regular
(D) None of these
S = {baa, ab}, then S* will not contain?
(A) abbaab
(B) abab
(C) baabaa
(D) abbaa
PALINDROME can be defined by more than one regular language?
(A) True
(B) False
(C) By only one RE
(D) Some times By only one RE and Some times False
If S = {aa, bb}, then S* will not contain?
(A) aabbaa
(B) bbaabbbb
(C) aaabbb
(D) aabbbb
Which of the following is not a word of language EQUAL?
(A) aaabbb
(B) abbbabaa
(C) abababa
(D) bbbaaa