Answer Happy

Question 7 Pushdown Automata a. Consider the language C of all palindromes over (a, b). Consider the Pushdown Automaton M that accepts L, where M = ({90, 91-92) (a,b),(a, b, Zo). Zo. (92),6). and 6 is given in the following table: Move State Input Stack symbol Zo Zu a 1 2 3 4 5 6 7 8 9 10 11 12 20 20 90 90 90 70 41 01 a h n b a b A X 1 h h h Zu h h Za Move(s) (go, aZo) (go, bZo) (90. aa) (go, ba) (go, ab) (go, bb) (91, Zo) (g₁, a) (₁. A) (₁. A) (92, Zo) e (ii) (91.Zo) (g. Zo) (91.a) (9₁.a) (9₁, b) (81, b) Answer the following questions: (i) Give the number of one move in & that doesn't use any input symbol. 100% (iii) Give the number of one move in ó that erases an a on top of the stack. I mark(s) (ii) Give the number of one move in 6 that reads an input symbol, but doesn't store it on the stack. I mark(s) I mark(s) (iv) Give the number of one move in 6 that reads an input symbol b and stores it on the stack 100% ) Consider the word wababa 1. Give one sequence of moves on w that leads to uw being accepted. Remember to give the number of every move. 6 mark(s) 2. Give one sequence of moves on w that leads to w not being accepted. Remember to give. the number of every move. 2 mark(s) D X