Skip to main content

Theory of Automata MCQs with Answers

Practice important Theory of Automata MCQs with answers and explanations.

Multiple Choice Questions

Q81: The language of strings containing double 'a' over Σ = {a, b} is expressed by:
  • A: a(a + b)*
  • B: (a + b)aa(a + b)
  • C: (a + b)*a
  • D: a(a + b)*a
View Answer
B

Q82: What does the regular expression (0+1)* (00 + 11) (0+1)* represent?
  • A: Strings of odd length
  • B: Strings with double 0's or double 1's
  • C: Strings starting with 0 or 1
  • D: Strings containing at least one 0
View Answer
B

Q83: The regular expression for strings containing triple 'a's or triple 'b's over Σ = {a, b} is:
  • A: (a+b)aaa(a+b)
  • B: (a+b)bbb(a+b)
  • C: a(a+b)
  • D: (a+b)(aaa + bbb)(a+b)
View Answer
D

Q84: Which of the following regular expressions represents the EVEN-EVEN language over Σ = {a, b}?
  • A: (aa+bb+(ab+ba)(aa+bb)(ab+ba))
  • B: (ab+ba)(aa+bb)*
  • C: aa+bb
  • D: (aa + bb)*
View Answer
A

Q85: Fill in the blank: The language of strings over Σ = {a, b} that starts with 'a' and ends with 'b' can be expressed as _____.
  • A: a(a + b)*b
  • B: (a + b)*b
  • C: a(a+b)+
  • D: a(b + a)*
View Answer
A

Q86: The finite automaton (FA) accepting all non-empty strings over Σ = {a, b} can be expressed by the regular expression:
  • A: (a + b)*
  • B: (a + b)+
  • C: (a)*b
  • D: (b)*a
View Answer
B

Q87: What is the difference between FA1 and FA3 if both accept the same language?
  • A: FA1 has fewer states than FA3
  • B: FA3 is disconnected
  • C: FA1 has no final state
  • D: FA3 has fewer transitions than FA1
View Answer
B

Q88: Which of the following FA accepts the language containing triple a's or triple b's over Σ = {a, b}?
  • A: FA1
  • B: FA2
  • C: FA3
  • D: FA4
View Answer
C

Q89: Fill in the blank: A disconnected FA is one where _____.
  • A: No path exists between states
  • B: All states are connected
  • C: It accepts only empty strings
  • D: It rejects all input strings
View Answer
A

Q90: The language L defined over Σ = {a, b} containing no string is represented by:
  • A: Empty set (Ø)
  • B: Null set (Λ)
  • C: (a + b)*
  • D: a(a + b)*
View Answer
A

Test Your Knowledge

Take a timed quiz on Theory of Automata

🚀 Start Quiz Now