Subject: Theory of computing

Section: The languages of pushdown automata

Exercise 6.2.5 : PDA P = ({qo,Y1,Y2, q3, f), ta, b), {ZgA. B), , qo, Zo, {f)) has the following rules defining : (Y1 . AAA) (a,b, A) (qi ,e) Note that, since each of the sets above has only one choice of move, we have omitted the set brackets from each of the rules. * a) Give an execution trace (sequence of ID's) showing that string bab is in L(P) b) Give an execution trace showing that abb is in L(P) c) Give the contents of the stack after P has read ba from its input ! d) Informally describe L(P)