Theory of Computation - Old Questions
11. Construct a PDA that accepts the strings of language L={ wwR | w is in {a, b}*}.
8 marks
|
Asked in 2074