Generalized nondeterministic finite automaton: Difference between revisions

Revision as of 01:07, 25 September 2007

Revision as of 08:00, 22 March 2008

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'');