Theory of Automata MCQs with Answers
Practice important Theory of Automata MCQs with answers and explanations.
Multiple Choice Questions
Q211: Fill in the blank: A NFA may have _______ transitions for a single input.
- A: only one
- B: no
- C: more than one
- D: none
View Answer
C
Q212: Which of the following is true for converting FA to NFA?
- A: FA loses all its transitions
- B: NFA adds additional states
- C: FA and NFA become equivalent
- D: NFA cannot accept the same language
View Answer
C
Q213: Fill in the blank: An NFA accepts a string if there is _______ path leading to a final state.
- A: one
- B: two
- C: no
- D: any
View Answer
A
Q214: What is the shortest string accepted by the NFA applied to a maze?
- A: aaa
- B: aaaaa
- C: aaaaaa
- D: aaaaaaaaa
View Answer
C
Q215: What is the regular expression for the NFA accepting infinite strings starting with six 'a's?
- A: aaaaa(aa)*
- B: aaaaaa(aa)*
- C: aaaaaa(bb)*
- D: aaaaaaaa
View Answer
B
Q216: What additional feature does an NFA with Null string (NFA∧) have compared to a regular NFA?
- A: Infinite states
- B: Multiple initial states
- C: Null string transitions
- D: Multiple final states
View Answer
C
Q217: Fill in the blank: An NFA∧ accepts strings defined over Σ = {a, b} that end in ______.
- A: a
- B: b
- C: ab
- D: ∧
View Answer
B
Q218: In method 1 of converting NFA to FA, what is the key step?
- A: Eliminating all transitions
- B: Converting NFA to a TG
- C: Using Kleene’s theorem
- D: Removing null transitions
View Answer
C
Q219: Which of the following is NOT true about NFA to FA conversion?
- A: There may be more than one transition for a letter
- B: An empty state is introduced for letters with no transitions
- C: The NFA becomes deterministic
- D: An NFA can never be equivalent to an FA
View Answer
D
Q220: What is introduced for a letter that has no transition in NFA during FA conversion?
- A: Final state
- B: Empty state
- C: Null state
- D: Infinite loop
View Answer
B