Theory of Computation - Old Questions
12. Define the language of PDA that accepts by Final State. Explain how a PDA accepting empty stack can be converted into a PDA by final state.
8 marks
|
Asked in 2067