Intermediate
Theory of Computation
Q61 / 100
What is the two-stack PDA and its expressive power?
Correct! Well done.
Incorrect.
The correct answer is B) Equivalent to a Turing machine — recognizes all RE languages
B
Correct Answer
Equivalent to a Turing machine — recognizes all RE languages
Explanation
A PDA with two stacks is equivalent to a Turing machine. One stack simulates the left part of the tape and one the right part. This shows the power jump from one to two stacks.
Progress
61/100