Properties of DCFL’s
We need the following lemma for the constructive proof of Theorem 1. This lemma,which simplifies the PDA model, will also be used for the proof of Theorem 2.
Normal form of PDA
). Every CFL can be recognized by a PDA whichsatisfies the following conditions.
The PDA never empties the stack (i.e., it does not pop Z
when pushes, the machine pushes exactly one symbol, and
never changes the stack-top.
Let M = (Q,
, F) be a PDA, where p, q
Q, A, B
}. Notice that conditions (2) and (3) does not allow a pushing move, like
) = (q, B
), where the original stack-top A is changed to
. This normalform applies all PDA’s, either deterministic or nondeteriministic. In the ruminationsection at the end of Chapter 4, we showed that condition (2) does not affect thelanguage recognized by a PDA. Here we show that the lemma is true for conditions (1)and (3).
Normal Form of PDA