Constructing PDA with either one state or two states

105 Views Asked by At

If $L$ is a context-free language and $\epsilon \notin L $, how do you show that there exists a PDA that accepts the language by final state such that it has not more than two states and makes no $\epsilon$-moves ?

1

There are 1 best solutions below

2
On

Hint: Take a context-free grammar in Chomsky normal form for $L$ and think about how you might be able to use this to construct the PDA in question. (You can use the stack to perform the derivations, essentially.)