0 votes 0 votes Show that if $P$ is a PDA, then there is a one-state PDA $,P_{1},$ such that $N(P_{1})=N(P).$ Theory of Computation ullman theory-of-computation pushdown-automata + – admin asked Apr 7, 2019 • edited Apr 7, 2019 by Lakshman Bhaiya admin 260 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.