Generalized nondeterministic finite automaton: Difference between revisions

Revision as of 15:54, 5 February 2011

Revision as of 16:41, 19 September 2011

Line 7:

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