Skip to main content

Theory of Automata MCQs with Answers

Practice important Theory of Automata MCQs with answers and explanations.

Multiple Choice Questions

🚀 Start Quiz
Q131: Which of the following regular expressions represents strings starting and ending with different letters?
  • A: a(a+b)*a + b(a+b)*b
  • B: a(a+b)*b + b(a+b)*a
  • C: (a+b)*(aaa + bbb)
  • D: (a+b)(aa + bb)(a+b)
View Answer
B

Q132: Which regular expression represents the language containing double 'a' or double 'b'?
  • A: (a+b)* (aaa + bbb) (a+b)*
  • B: (a+b)* (aa + bb) (a+b)*
  • C: (a+b)(ab+ba)(a+b)*
  • D: (ab) (aa + bb) (ab)
View Answer
B

Q133: What does the regular expression a(a+b)*b + b(a+b)*a represent?
  • A: Strings containing triple 'a'
  • B: Strings with double 'b'
  • C: Strings beginning and ending in different letters
  • D: Strings starting with 'a' and ending with 'a'
View Answer
C

Q134: The regular expression (a+b)* (aaa + bbb) (a+b)* represents which language?
  • A: Strings containing triple 'a' or triple 'b'
  • B: Strings beginning and ending with same letter
  • C: Strings with only one 'a'
  • D: Strings with alternating 'a' and 'b'
View Answer
A

Q135: Which property of TGs and GTGs creates nondeterminism?
  • A: Existence of multiple start states
  • B: Lack of final state
  • C: Existence of multiple paths for a string
  • D: Presence of a regular expression
View Answer
C

Q136: What is true about Kleene’s Theorem Part I?
  • A: A TG can accept a language expressed by an RE
  • B: An FA can accept a language expressed by an RE
  • C: If a language can be accepted by an FA, it can also be accepted by a TG
  • D: If a language can be accepted by a TG, it can also be accepted by an FA
View Answer
C

Q137: Which part of Kleene’s Theorem states that a language accepted by a TG can be expressed by a regular expression?
  • A: Part I
  • B: Part II
  • C: Part III
  • D: Part IV
View Answer
B

Q138: According to Kleene’s Theorem Part III, if a language can be expressed by a regular expression, what else is true?
  • A: It can be accepted by an FA
  • B: It can be accepted by a TG
  • C: It can be expressed by another RE
  • D: It cannot be accepted by an FA
View Answer
A

Q139: In nondeterministic TGs, what differentiates them from finite automata (FAs)?
  • A: Absence of a final state
  • B: Multiple transition graphs
  • C: Existence of multiple paths
  • D: Only one path exists
View Answer
C

Q140: What is the starting state of a generalized transition graph (GTG)?
  • A: Initial state
  • B: Final state
  • C: Regular expression
  • D: Transition edge
View Answer
A

Test Your Knowledge

Take a timed quiz on Theory of Automata

🚀 Start Quiz Now