Theory of Computation - Old Questions
10. Prove that for any given NFA N accepting a language L there exists a DFA D such that L(N) = L(D).
8 marks
|
Asked in 2071