Is there any difference between regular language defined by DFA vs NFA?
What is the difference between a regular language defined by DFA vs NFA?
0
$\begingroup$
automata
regular-language
finite-automata
-
0No. For every NFA there's an equivalent DFA. – 2017-01-24
1 Answers
2
There is no difference, for every regular language defined by an NFA there is a DFA defining the same language. This is shown by the Powerset construction. The other direction is trivial as every DFA is also a NFA.