Theory of Computation - Old Questions
12. Define deterministic PDA. Design a PDA that accept a language L = {anbn | n>0}. You may accept either by empty stack or by final state.
8 marks
|
Asked in 2067-II