Theory of Automata MCQs with Answers
Practice important Theory of Automata MCQs with answers and explanations.
Multiple Choice Questions
Q351: In the example provided, what is the result of the quotient of two regular languages according to the theorem?
- A: The quotient is always regular
- B: The quotient is not regular
- C: The theorem is not applicable
- D: The result is indeterminate
View Answer
B
Q352: According to the pseudo theorem, what is required for a language Q to be regular if PQ=R and P and R are regular?
- A: Q must be regular
- B: P must be regular
- C: R must be regular
- D: P and R must be regular
View Answer
C
Q353: What is the main point of disproof for the pseudo theorem?
- A: Q is regular but not accepted by any FA
- B: Q is not regular and thus disproves the theorem
- C: Q is regular but does not satisfy PQ=R
- D: Q is regular and hence the theorem is proved
View Answer
B
Q354: If two languages R and Q are given, what does the language Pref(Q in R) represent?
- A: The set of strings that, when concatenated to the front of some word in Q, produce a word in R
- B: The set of all words in R
- C: The set of all words in Q
- D: The set of prefixes of words in R
View Answer
D
Q355: In the language L = EVENEVEN, what is the class containing all strings with even number of a’s and even number of b’s?
- A: C1
- B: C2
- C: C3
- D: C4
View Answer
D
Q356: Which language’s prefixes are defined by the example Q = {aa, abaaabb, bbaaaaa, bbbbbbbbbb} and R = {b, bbbb, bbbaaa, bbbaaaaa}?
- A: Pref(Q in R)
- B: Pref(R in Q)
- C: Q in R
- D: R in Q
View Answer
A
Q357: What is the result of taking the quotient of the language a* with a language that includes {anbn: n=0,1,2,…} and b*?
- A: a*b*
- B: b*
- C: a* {anbn}
- D: a* {anbn} b*
View Answer
A
Q358: What does the language Pref(Q in R) represent?
- A: A regular language
- B: A non-regular language
- C: A context-free language
- D: A Turing machine language
View Answer
A
Q359: If R is regular and Q is any language, what can be said about Pref(Q in R)?
- A: Always non-regular
- B: Always regular
- C: Regular if R is regular
- D: Non-regular if Q is infinite
View Answer
B
Q360: What type of problem is one that can be solved in a finite number of steps?
- A: Undecidable
- B: Decidable
- C: Effectively solvable
- D: Non-effectively solvable
View Answer
C