Prove that, A language L is accepted by some DFA if and only if L is accepted by some NFA.

Subject Theory of Computation
NU Year Set: 2.(a) Marks: 6 Year: 2017
Login to post your comment.