Theory of Computation - Old Questions
11. Give the formal definition of Push Down Automata. Construct a PDA accepting the language
L = {0n1n | n > 0}
8 marks
|
Asked in 2072