Generalized nondeterministic finite automaton: Difference between revisions

Revision as of 11:54, 2 October 2006

Revision as of 07:54, 5 November 2006

Line 5:

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 callcalled the alphabet (Σ)

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

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