A '''generalized nondeterministic finite state machine''' or '''generalized nondeterministic finite automaton''' (GNFA)''' is a [[nondeterministic finite state machine|NFA]] where each transition may be labeled with any regular expression. The GNFA read blocks of symbols from the input which constitute a string as defined by the regular expression on the transition.
==Formal definition==
A generalized nondeterministic finite automaton (GNFA) can be defined as a [[n-tuple|5-tuple]]: (''S'', Σ, ''T'', ''s'', ''a'')
