(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.
(a+b)*a(a+b)*b(a+b)* is the RE of language defined over S={a,b} having at least one a and one b?
(A) True
(B) False
(C) Such a language does not exist
(D) None of the given options
TG can have more than one initial state?
(A) True
(B) False
(C) Depends on alphabets
(D) None of these
Two machines are said to be equivalent if they print the same output string when the different input string is run on them?
(A) True
(B) False
(C) Depends on language
(D) May be or may not be
FA3 expresses r1r2. Then there will be at least one final state of FA3 that consist of final state of FA1 and initial state of FA2?
(A) True
(B) False
(C) Depends on language
(D) None of these
FA3 expresses r1r2. Then initial state of FA3 will consist of?
(A) Initial state of FA2
(B) Initial state of FA1
(C) Initial states of both FA1 & FA2
(D) Depends on FA’s
In which of the following language Rev(s)=s?
(A) EQUAL
(B) INTEGER
(C) PALINDROME
(D) FACTORIAL
(a + b)* a is RE for the language defined over S={a,b} having words not ending in b?
(A) True
(B) False
(C) Such a language is not regular
(D) None of the given options