Beginner Theory of Computation
Q7 / 100

What type of automaton recognizes context-free languages?

Correct! Well done.

Incorrect.

The correct answer is C) Pushdown Automaton (PDA)

C

Correct Answer

Pushdown Automaton (PDA)

Explanation

A Pushdown Automaton (PDA) extends a finite automaton with a stack, giving it the power to recognize context-free languages (e.g., balanced parentheses).

Previous All Questions Next
Progress
7/100
🤖

Browse All Theory of Computation Questions

100 questions · beginner to advanced