2. Let M₂ be the PDA below: M₂: a λ/A bλ/B a A/λ b B/). 8 2.2/2 90 Give the transition table of M₂. b) Give a cat theoretic definition of 1(M₂) Trace all computations of strings, wo in M₂. d) Show that aaaa, baab € L(M₂). e) Show that aaa, ab do not belong to L(M₂).

Theory that deals with fundamental questions around what problems can and cannot be solved using computation and uses a model of computation to understand the degree to which computers can assist in solving problems. There are three main branches of this subject: automata theory and formal languages, computational complexity theory, and computability theory.