Theory of Automata MCQs with Answers
Practice important Theory of Automata MCQs with answers and explanations.
Multiple Choice Questions
Q191: What does the transition table for FA3 represent?
- A: All possible states and transitions based on input
- B: Only the final states
- C: The initial state only
- D: The rejected states
View Answer
A
Q192: Fill in the blank: Kleene’s theorem part III, method 2 focuses on the _______ of FAs.
- A: concatenation
- B: union
- C: closure
- D: intersection
View Answer
A
Q193: Fill in the blank: The closure of an FA is like the ______ of the FA with itself.
- A: concatenation
- B: union
- C: intersection
- D: complement
View Answer
A
Q194: Fill in the blank: In the FA corresponding to r = (a+b)*b, the string accepted by the automaton must end with _______.
- A: b
- B: a
- C: a or b
- D: neither
View Answer
A
Q195: Fill in the blank: The FA corresponding to r1r2 consists of states labeled _______.
- A: z1, z2, z3
- B: x1, x2, y1
- C: s1, s2, s3
- D: f1, f2
View Answer
A
Q196: What is the unique property of an NFA?
- A: Multiple start states
- B: Single start state
- C: No start state
- D: Multiple final states
View Answer
B
Q197: An NFA is a collection of how many components?
- A: 2
- B: 3
- C: 4
- D: 5
View Answer
B
Q198: Which of the following is NOT a valid input symbol in an NFA?
- A: a
- B: b
- C: c
- D: ∧
View Answer
D
Q199: What is the alphabet Σ in the NFA defined over {a, b, c}?
- A: {a}
- B: {a, b}
- C: {a, b, c}
- D: {a, c}
View Answer
C
Q200: How does an NFA accept a string?
- A: If there exists one successful path
- B: If all paths are successful
- C: If there is no transition
- D: If the input is empty
View Answer
A