Generalized nondeterministic finite automaton: Difference between revisions

Content deleted Content added
Formal definition: Replace unicode setminus with <math>\setminus</math>
 
Line 20:
* A graphical description of GNFAs and the process of converting an NFA to a regular expression using GNFAs, can be found at [http://www.cs.sunysb.edu/~cse350/slides/rgExp2.pdf]
 
[[Category:Finite-state automatamachines]]