Using a trace table like those in this chapter, show what happens to the INPUT TAPE and STACK as each of the following words proceeds through the machine.
(i) What is the language accepted by this PDA?
(ii) Find a CFG that generates this language.
(iii) Is this language regular?