Theory of Automata MCQs with Answers
Practice important Theory of Automata MCQs with answers and explanations.
Multiple Choice Questions
Q111: In the given example, what does TG2 lack at state 1?
- A: Transitions for 'a' and 'b'
- B: A final state
- C: A starting state
- D: A transition at state 1
View Answer
D
Q112: Which regular expression describes a language L that starts with 'b' and is defined over Σ = {a, b}?
- A: a(a+b)*
- B: b(a+b)*
- C: (a+b)aa(a+b)
- D: (a+b)bb(a+b)
View Answer
B
Q113: The regular expression Λ + (a + b)*a describes which of the following languages?
- A: Strings starting with 'b'
- B: Strings not ending with 'b'
- C: Strings containing 'aa'
- D: Strings containing 'bb'
View Answer
B
Q114: Which TG accepts strings containing double 'a' over Σ = {a, b}?
- A: TG1
- B: TG2
- C: TG3
- D: All of the above
View Answer
C
Q115: The regular expression (a+b)(aa)(a+b) describes a language containing:
- A: Double 'a'
- B: Double 'b'
- C: Strings starting with 'a'
- D: Strings not ending in 'b'
View Answer
A
Q116: What is true about the TG in which states are not labeled?
- A: It is still a valid TG
- B: It may not be considered a single TG
- C: It will reject all strings
- D: It will accept all strings
View Answer
B
Q117: In the given example, what is the regular expression for strings not ending in 'b'?
- A: Λ + (a + b)*a
- B: (a + b)*b
- C: (a + b)*a
- D: (a + b)(a + b)*
View Answer
A
Q118: What does the "+" symbol represent in regular expressions?
- A: OR operator
- B: AND operator
- C: Concatenation
- D: None of the above
View Answer
A
Q119: Which of the following TGs accepts strings having double 'a' or double 'b'?
- A: TG1
- B: TG2
- C: TG3
- D: All of the above
View Answer
D
Q120: What does the expression (a+b)(aa + bb)(a+b) represent?
- A: Strings starting with 'a'
- B: Strings containing 'aa' or 'bb'
- C: Strings ending with 'b'
- D: Strings without 'a'
View Answer
B