Skip to main content

Theory of Automata MCQs with Answers

Practice important Theory of Automata MCQs with answers and explanations.

Multiple Choice Questions

Q71: Which of the following is true about the language of strings of even length?
  • A: It can be expressed by the regular expression ((a + b)(a + b))*
  • B: It starts with 'b'
  • C: It has only one final state
  • D: It is not regular
View Answer
A

Q72: What is the regular expression for a language of strings of length two, starting with 'a'?
  • A: aa + ab
  • B: ba + bb
  • C: (a + b)*(a + b)
  • D: a(a + b)*
View Answer
A

Q73: The finite automaton accepting a language over Σ = {a, b}, where strings start with 'a' can be expressed by:
  • A: (a+b)*
  • B: a(a + b)*
  • C: aa + bb
  • D: b(a + b)*
View Answer
B

Q74: Fill in the blank: The language of strings of length two or more, starting and ending with the same letter, is represented by the regular expression _____.
  • A: a(a + b)* a + b(a + b)* b
  • B: (a + b)*
  • C: aa + bb
  • D: b(a + b)*
View Answer
A

Q75: The finite set of input letters in a finite automaton (FA) is called:
  • A: Input strings
  • B: Alphabet
  • C: Transition
  • D: State
View Answer
B

Q76: Which regular expression describes the language L of strings beginning and ending with 'a'?
  • A: a(a + b)* a
  • B: a(a + b)* + Λ
  • C: (a + b)*a
  • D: (a + b)(a + b)
View Answer
A

Q77: The language of strings starting and ending with different letters over Σ = {a, b} is expressed by:
  • A: a(a + b)*b
  • B: (a + b)*a
  • C: b(a + b)*
  • D: (a + b)*
View Answer
A

Q78: What is the regular expression for the language of all non-empty strings over Σ = {a, b}?
  • A: (a + b)*
  • B: (a + b)+
  • C: a(a + b)
  • D: b(a + b)
View Answer
B

Q79: The finite automaton that does not accept any string, including the null string, is an example of:
  • A: An empty FA
  • B: A disconnected FA
  • C: A non-final FA
  • D: A null FA
View Answer
B

Q80: Two finite automata (FAs) are considered equivalent if they:
  • A: Have the same number of states
  • B: Accept the same language
  • C: Start and end in the same state
  • D: Both accept the null string
View Answer
B

Test Your Knowledge

Take a timed quiz on Theory of Automata

🚀 Start Quiz Now