Theory of Computation - Old Questions
12. Construct a Push Down Automata that accepts all the strings from alphabet {0, 1} with equal number of 0 and 1. Show that 0110 is accepted by this PDA and 01101 is not.
8 marks
|
Asked in 2075