Generalized nondeterministic finite automaton: Difference between revisions

Revision as of 21:45, 29 May 2007

Revision as of 23:07, 22 September 2007

Line 4:

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'' -{''a''}) × (''S'' - {''s''}) → ''R'');

* a start state (''s'' ∈ ''S'');

* an accept state (''a'' ∈ ''S'');

where ''R'' is the collection of all [[regular expressions]] over the alphabet Σ.