Theory of Computation - Old Questions
13. Define PDA. Explain how a PDA accepting by empty stack is converted into equivalent PDA accepting same language by final state.
8 marks
|
Asked in 2076