Content deleted Content added
Undid revision 1221071763 by Kku (talk): link referred to chemistry, not computer-science, meaning |
This reference includes only an author's name and a title. |
||
Line 12:
| first = Prabhakar
| title = Application of Finite automata
}}</ref>{{full citation needed}}
DFAs have been generalized to ''[[nondeterministic finite automata]] (NFA)'' which may have several arrows of the same label starting from a state. Using the [[powerset construction]] method, every NFA can be translated to a DFA that recognizes the same language. DFAs, and NFAs as well, recognize exactly the set of [[regular language]]s.<ref name="Hopcroft 2001"/>
| |||