Generalized nondeterministic finite automaton: Difference between revisions

Revision as of 20:58, 12 November 2004

Revision as of 23:32, 16 November 2004

Line 1:

In 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 readreads blocks of symbols from the input which constitute a string as defined by the regular expression on the transition.

==Formal definition==