Given the following PDA describe the language it accepts.Q = { q0, q1, q2 } = { a, b } = { A, B }F = { q1, q2 }z = B ( q0, a, B ) = { ( q0, AB ) } ( q0, , B ) = { ( q1,  ) } ( q0, b, A ) = { ( q2,  ) } ( q0, a, A ) = { ( q0, AA ) } ( q2, b, A ) = { ( q2,  ) } ( q2, , A ) = { ( q2,  ) } ( q2, , B ) = { ( q1,  ) }Answer: { ai bj | 0  j  i }Can somebody show me the steps to reach the answer. What general strategy/ steps are used to answer these type of questions?
How to find what language a PDA accepts?
automata;pushdown automata