We know algorithm to convert each PDA in the underlying grammar that generates the language the PDA recognize. But we have also the algorithm for creating a two state pda from a grammar. This algorithm use the first state for all the computation, with rules based on the stack and the input symbol, and when the stack is empty goes to a final state. This means that, for all the generic PDAs we can create a minimal PDA with only two states (and a lot of rules for the first state). Am I right?
closed as unclear what you're asking by Raphael♦ Feb 10 '14 at 11:42
Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.