Let M = (Q,,,q0,,F) be a pushdown automaton. Define L(M) to be the language L(M) = {w | it is possible for M to start in state q0, read all of w, and end in an accepting state}. L(M) differs from L(M) in that for w L(M), we do not require that the stack be empty at the end of the computation.

c) Identify the language L(M) for each of the automata in Exercise 1 (picture)

1. Identify the context-free language that is accepted by each of the following pushdown automata. Explain your answers a) b, E/1 C,1/E E,E/e b, E/1 c,1/E d,1/E ,E/e E,E/e 0 c) b, E/2 d,1/2 E,/2 ,E/E E,E/e 0 d) a, E/a a,a/E 0 E,E/a b, E/b b, E/E b,b/2