Generalized nondeterministic finite automaton: Difference between revisions

Revision as of 11:50, 2 October 2006

Revision as of 11:50, 2 October 2006

Line 7:

* a finite set call the alphabet (Σ)

* a transition [[function (mathematics)|function]] (''T'' : (''S'' -{''a''}) × (''S'' - {''s''}) → ''R'')

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

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

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