Theory of Computation - Old Questions
8. Define a Push Down Automata. Construct a PDA that accept L = {anbn | n>=0}.
5 marks
|
Asked in 2078