Theory of Automata MCQs with Answers
Practice important Theory of Automata MCQs with answers and explanations.
Multiple Choice Questions
Q61: A regular expression defining strings of length 2, starting with a, is ______.
- A: a*a
- B: aa+ab
- C: a*b
- D: ab+ba
View Answer
B
Q62: Which language is accepted by a finite automaton starting with a symbol 'b'?
- A: L1 = b(a + b)*
- B: L2 = a(a + b)* + Λ
- C: L = b(aa + bb)
- D: L = b(aa + bb)(a + b)
View Answer
A
Q63: What is the regular expression for a language of strings over Σ = {a, b} starting with b?
- A: (a+b)*a
- B: b(a + b)*
- C: (a + b)*(a + b)
- D: b(aa + bb)
View Answer
B
Q64: In a transition diagram, the final state is represented by:
- A: A single circle
- B: A double circle
- C: A dashed circle
- D: An arrow before the state
View Answer
B
Q65: The language L1 defined by the regular expression a(a + b)* represents:
- A: Strings starting with b
- B: Strings starting with a
- C: Strings ending in b
- D: Strings containing an even number of a’s
View Answer
B
Q66: How is the initial state represented in a finite automaton?
- A: A single circle
- B: A dashed circle
- C: An arrow pointing to the state
- D: A double circle
View Answer
C
Q67: Which regular expression describes strings over Σ = {a, b} ending in a?
- A: b(a + b)*
- B: a(a + b)* + Λ
- C: (a + b)*a
- D: (a + b)*b
View Answer
C
Q68: The language of strings beginning and ending with the same letter can be expressed as:
- A: a(a + b)* a + b(a + b)* b
- B: (a+b)*(a+b)
- C: (a + b)*(a + b)
- D: aa + bb
View Answer
A
Q69: Which language is defined by the regular expression ((a + b) (a + b))*?
- A: Strings of odd length
- B: Strings of even length
- C: Strings containing only 'a'
- D: Strings starting with 'b'
View Answer
B
Q70: Fill in the blank: The language of strings ending in 'a' over Σ = {a, b} can be expressed by the regular expression _____.
- A: b(a + b)*
- B: (a + b)*a
- C: (a + b)*
- D: a(a + b)*
View Answer
B