Theory of Computation - Old Questions
13. Discuss the equivalent of PDA and CFG. Convert the grammar
S→aAA
A→aS|bS|a
to a PDA that accepts the same language by empty stack.
8 marks
|
Asked in 2073