Generalized nondeterministic finite automaton: Difference between revisions

Content deleted Content added
m Reverting possible vandalism by 145.94.188.124 to version by I dream of horses. Report False Positive? Thanks, ClueBot NG. (3624221) (Bot)
m convert special characters (via WP:JWB)
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'');