Content deleted Content added
m Reverted edits by 69.81.14.78 to last version by 61.21.31.239 |
|||
Line 4:
A GNFA can be defined as a [[n-tuple|5-tuple]], (''S'', Σ, ''T'', ''s'', ''a''), consisting of
* a finite set of
* a finite set call the
* a transition [[function (mathematics)|function]] (''T'' : (''S'' -{''a''}) × (''S'' - {''s''}) → ''R'')
* a start state (''s'' ∈ ''S'')
| |||