Editing Generalized nondeterministic finite automaton (section)

==Formal definition==
A GNFA can be defined as a [[n-tuple|5-tuple]], (''S'', Σ, ''T'', ''s'', ''a''), consisting of
* a [[finite set]] of states (''S'');
* a finite set called the alphabet (Σ);
* a transition [[function (mathematics)|function]] (''T'' : (''S'' <math>\setminus</math> {''a''}) × (''S'' <math>\setminus</math> {''s''}) → ''R'');
* a start state (''s'' ∈ ''S'');
* an accept state (''a'' ∈ ''S'');
where ''R'' is the collection of all regular expressions over the alphabet Σ.

The transition function takes as its argument a pair of two states and outputs a regular expression (the label of the transition).  This differs from other finite state machines, which take as input a single state and an input from the alphabet (or the empty string in the case of nondeterministic finite state machines) and outputs the next state (or the set of possible states in the case of nondeterministic finite state machines). A [[deterministic finite automaton|DFA]] or [[nondeterministic finite automaton|NFA]] can easily be converted into a GNFA and then the GNFA can be easily converted into a [[regular expression]] by repeatedly collapsing parts of it to single edges until ''S'' = {''s'', ''a''}. Similarly, GNFAs can be reduced to NFAs by changing regular expression operators into new edges until each edge is labelled with a regular expression matching a single string of length at most 1. NFAs, in turn, can be reduced to DFAs using the [[powerset construction]]. This shows that GNFAs recognize the same set of [[formal language]]s as DFAs and NFAs.