Theory of Automata MCQs with Answers
Practice important Theory of Automata MCQs with answers and explanations.
Multiple Choice Questions
Q201: What is the relationship between FA and NFA according to Kleene’s theorem?
- A: FA can be converted to TG only
- B: NFA can be converted to FA
- C: FA and NFA are equivalent
- D: NFA is always smaller than FA
View Answer
C
Q202: Which of the following statements about NFAs is true?
- A: NFAs cannot have multiple transitions for the same input
- B: NFAs are equivalent to TGs
- C: NFAs do not accept regular languages
- D: NFAs cannot accept any strings
View Answer
B
Q203: Fill in the blank: An NFA can accept a string if _______ path reaches a final state.
- A: every
- B: at least one
- C: no
- D: none of the
View Answer
B
Q204: What is the key difference between FA and NFA?
- A: FA has multiple initial states
- B: NFA allows multiple transitions for the same input
- C: FA is nondeterministic
- D: NFA cannot accept strings with loops
View Answer
B
Q205: What does an NFA help to eliminate in a FA?
- A: Final state
- B: Initial state
- C: Loop
- D: Alphabet
View Answer
C
Q206: What is the result of converting an FA to NFA as per Kleene’s theorem?
- A: FA is reduced to a single state
- B: FA is converted to a TG
- C: FA and NFA become equivalent
- D: NFA cannot be converted back to FA
View Answer
C
Q207: What does an NFA do when there is no valid transition for an input?
- A: Accepts the input
- B: Rejects the input
- C: Creates a new state
- D: Loops indefinitely
View Answer
B
Q208: Fill in the blank: The NFA corresponding to the FA for (a+b)*b accepts strings ending with _______.
- A: a
- B: b
- C: a or b
- D: c
View Answer
B
Q209: In the example of applying an NFA to a maze, what is being solved?
- A: A regular expression
- B: A finite automaton
- C: A maze puzzle
- D: A transition table
View Answer
C
Q210: What is the main application of NFA in artificial intelligence?
- A: Loop detection
- B: Pathfinding
- C: Language processing
- D: Data encryption
View Answer
B