Question 1: Construct a PDA that accepts the language of alphabet [= {a,x} L(G) = {amx am: m 2 0} then trace the followi
Posted: Fri Jun 10, 2022 11:58 am
Question 1: Construct a PDA that accepts the language of alphabet [= {a,x} L(G) = {amx am: m 2 0} then trace the following string: aaaxaaa (show the stack)