... the same states, start state and final states. Its configurations are triples Is, a, w) of a state, a stack and an input string. The stack is a sequence of pairs / s, X) of a state and ... consist of a se- quence of a start state, reading states, a crossover state, prefinal states, and a final state. The excep- tion to this is a path accepting the empty string, which has a start state, ... e-transition, there is a sequence of G-transitions leading to the final state [$' * S.]. Hence ~" has the following kinds of states: the start state, the final state, states with terminal transitions...