Theory of Automata MCQs with Answers
Practice important Theory of Automata MCQs with answers and explanations.
Multiple Choice Questions
Q161: When eliminating intermediate states in a TG, what happens to the corresponding RE?
- A: It remains the same
- B: It is concatenated
- C: It is multiplied by the number of states
- D: It is reversed
View Answer
B
Q162: The sum, concatenation, and closure of two regular expressions result in:
- A: A new regular expression
- B: A new FA
- C: A new NFA
- D: A TG
View Answer
A
Q163: To convert a TG to an equivalent GTG, what is added to the transitions?
- A: Alphabet symbols
- B: Regular expressions
- C: Final states
- D: Loops
View Answer
B
Q164: Fill in the blank: The _________ state in a TG is used to handle multiple final states by redirecting transitions labeled Λ.
- A: initial
- B: intermediary
- C: final
- D: bypass
View Answer
C
Q165: Fill in the blank: The regular expression corresponding to a TG with a single loop at state 1 may be reduced to ________.
- A: (aa+bb+(ab+ba)(aa+bb)(ab+ba))
- B: (a+b)*b
- C: (a+b)aa(a+b)
- D: (b+aa)b*+(a+bb)a*
View Answer
A
Q166: Fill in the blank: Method 1 of Kleene’s Theorem Part III is used to construct an FA by the _______ of two FAs.
- A: intersection
- B: concatenation
- C: sum
- D: union
View Answer
D
Q167: In Kleene’s theorem, Part III (Method 2), which operation is performed on two FAs to build a new FA?
- A: Union
- B: Concatenation
- C: Intersection
- D: Complement
View Answer
B
Q168: How many possible combinations of states are there when FA1 has 2 states and FA2 has 3 states?
- A: 5
- B: 6
- C: 7
- D: 8
View Answer
B
Q169: What happens to FA3 when combining FA1 and FA2 in the concatenation method?
- A: States remain the same
- B: Number of states increases
- C: Number of states decreases
- D: FA3 becomes the same as FA1
View Answer
C
Q170: The concatenation of two regular expressions, r1 and r2, corresponds to which FA operation?
- A: Addition
- B: Concatenation
- C: Closure
- D: Union
View Answer
B