Theory of Computation - Old Questions
13. Prove that any regular language can be accepted by a finite automata with all details.
8 marks
|
Asked in 2070