AIn the [[theory of computation]], 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.
