Theory of Computation - Old Questions
9. Show that a language L is accepted by some DFA if and only if L is accepted by some NFA.
8 marks
|
Asked in 2067-II