Theory of Automata MCQs with Answers
Practice important Theory of Automata MCQs with answers and explanations.
Multiple Choice Questions
Q91: What is the regular expression for the language of strings that contains at least one occurrence of 'aa' over Σ = {a, b}?
- A: (a+b)aa(a+b)
- B: aa(a+b)
- C: (a + b)*a
- D: a(a + b)*a
View Answer
A
Q92: What is the regular expression for the language L = {Λ, b, ab, bb}, defined over Σ = {a, b}?
- A: Λ + b + ab + bb
- B: ab + bb + aa
- C: a + b
- D: Λ + a + b
View Answer
A
Q93: In an FA, what are dead states also referred to as?
- A: Final states
- B: Start states
- C: Davey John Lockers
- D: Transition states
View Answer
C
Q94: Which structure can help build an FA for a language with fewer strings?
- A: Tree structure
- B: Graph structure
- C: FA diagram
- D: Finite transition table
View Answer
A
Q95: The regular expression for the language L = {aa, bab, aabb, bbba}, defined over Σ = {a, b}, is:
- A: aa + bb + ab
- B: aa + bab + aabb + bbba
- C: ab + bba + aa
- D: ab + bb
View Answer
B
Q96: The language L = {w belongs to {a,b}*: length(w) ≥ 2 and w neither ends in aa nor bb} is expressed by:
- A: (a + b)* (ab + ba)
- B: (a + b) + aa + bb
- C: ab + ba + bb
- D: (a+b) (bb+ab)
View Answer
A
Q97: What is the purpose of a transition graph (TG) in FA?
- A: Shows input letters
- B: Defines states
- C: Shows state transitions
- D: Displays null strings
View Answer
C
Q98: A transition graph (TG) consists of which of the following?
- A: Finite number of states
- B: Infinite states
- C: Infinite number of input letters
- D: Null strings only
View Answer
A
Q99: What is the regular expression for the language L = {w belongs to {a,b}*: w does not end in aa}?
- A: a + b + Λ
- B: Λ + a + b + (a+b)* (ab+ba+bb)
- C: ab + ba + bb
- D: (a + b)* aa
View Answer
B
Q100: Which of the following states does not have a final state in the FA corresponding to L = {Λ, b, ab, bb}?
- A: State 1
- B: State x
- C: State 5
- D: State 4
View Answer
B