3 votes 3 votes Theory of Computation theory-of-computation context-free-language pushdown-automata + – Don't you worry asked Jun 1, 2016 • retagged Jul 4, 2017 by Arjun Don't you worry 4.4k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 6 votes 6 votes A two-stack PDA is equivalent in computing power to a Turing machine. Since a Turing machine can accept that language (stated without proof), a two-stack PDA can as well. shekhar chauhan answered Jun 1, 2016 • selected Jun 2, 2016 by Don't you worry shekhar chauhan comment Share Follow See all 0 reply Please log in or register to add a comment.
