Theory of Automata MCQs with Answers
Practice important Theory of Automata MCQs with answers and explanations.
Multiple Choice Questions
Q151: What is the role of a transition labeled by Λ in TGs?
- A: Represents a regular language
- B: Eliminates nondeterminism
- C: Connects old and new states
- D: Acts as a final state
View Answer
C
Q152: Fill in the blank: Kleene's Theorem Part II explains how a ___________ can be obtained corresponding to a TG.
- A: FA
- B: RE
- C: GTG
- D: DFA
View Answer
B
Q153: What happens when a state in a TG has multiple incoming transitions with corresponding REs?
- A: It is eliminated
- B: A single transition is introduced
- C: The TG is converted to a DFA
- D: The transitions are merged
View Answer
D
Q154: Fill in the blank: Kleene's Theorem Part I proves that if a language can be accepted by an FA, it can be accepted by a ___________.
- A: TG
- B: RE
- C: GTG
- D: NFA
View Answer
A
Q155: What does Kleene’s Theorem Part III state?
- A: Any language can be expressed by an FA
- B: If a language can be expressed by a RE, then there exists an FA accepting it
- C: FA cannot accept a regular language
- D: FA and RE are unrelated
View Answer
B
Q156: What is the purpose of the transition labeled by Λ in TGs?
- A: To represent concatenation
- B: To represent a union
- C: To represent an empty transition
- D: To represent a closure
View Answer
C
Q157: When reducing a TG to have a single initial and single final state, what is the main step?
- A: Remove all loops
- B: Eliminate all intermediate states
- C: Introduce an additional initial and final state
- D: Merge all transitions into one
View Answer
C
Q158: The language over Σ = {a, b} consisting of only b can be accepted by what type of automaton?
- A: TG
- B: GTG
- C: FA
- D: NFA
View Answer
C
Q159: In Method 1 (Union of two FAs), the union of two FAs corresponds to which operation on regular expressions?
- A: Concatenation
- B: Addition
- C: Closure
- D: Subtraction
View Answer
B
Q160: Which of the following regular expressions corresponds to a language accepted by an FA with a single transition edge?
- A: (a+b)*b
- B: (a+b)*(a+b)
- C: b*+(a+bb)a*
- D: ab
View Answer
C