Theory of Computation - Old Questions
10. Construct a PDA accepting language over {0, 1} representing strings with equal no of 0s and1s. Show by sequence of IDs that 0101 is accepted by this PDA. (3+2)
5 marks
|
Asked in 2076 (new)