Theory of Computation - Old Questions
2. Construct a DFA that accepts all the strings of alphabet {a, b} having each strings with even number of 0’s and even number of 1’s.
4 marks
|
Asked in 2071
Answered by Hunter