Question: Let a k-PDA be a pushdown automaton that has k stacks. Thus a 0-PDA is an NFA and a 1-PDA is a conventional PDA. You
Let a k-PDA be a pushdown automaton that has k stacks. Thus a 0-PDA is an NFA and a 1-PDA is a conventional PDA. You already know that 1-PDAs are more powerful (recognize a larger class of languages) than 0-PDAs.
a. Show that 2-PDAs are more powerful than 1-PDAs.
b. Show that 3-PDAs are not more powerful than 2-PDAs.
Simulate a Turing machine tape with two stacks.
Step by Step Solution
3.24 Rating (168 Votes )
There are 3 Steps involved in it
1 a To prove a 2PDA is more powerful than a 1PDA it must be shown that a 2PDA can do anything a 1PDA ... View full answer
Get step-by-step solutions from verified subject matter experts
