Solve as many as possible..

tomaton (PDA) for the following languages. ali ndromes wewk ov er la, b, c put abbcbba. Show how it rejects abbcbb. See Example & odd pal { a, b, c} where w = (a + b)". Show an accepting sequence of sting of parentheses and flower brackets. For example, rejects tOtIO))) 0f10Show how it 0. Show, along with two different accepting sequences of configurations, minism works to accept the string aaabbb in two different ways 0. Make sure that the PDA is deterministic. , n> 0. Make sure that the PDA is deterministic. 5. a'bab",n d, where 2n = m and k > 2, Make sure that the PDA is deterministic 6. aW 7, any", where m = 8. a'b, where n mod 3. How much stack memory do you need to handle this language? m is the nearest number equal to or higher than n that is divisible by 5. How much stack . How memory do you need to handle this language? How many states do you need in the PDA? Explain. 9. a'b", where n is a multiple of 3 and m is n/3. Make sure that the PDA is deterministic. 10. any", where rn = n 3 . Make sure that the PDA is deterministic 11. The language of subtraction, that is, strings of the form a b d where k = n-m if n 2 m or else k m -7n. Show an accepting sequence of conigurations for the input aabbbec. Show the rejecting sequence of configurations for the input aaaabbecc. 12. The language of addition with positive or negative numbers, that is, strings over the alphabet la. b, c, - of the form: (a) a pt (b) _ where k = n + m and both numbers are positive; for example, aabbcccc. a lyd, where k = m n if m 2 n and the first number is negative; for example,-dat bbbce