Generalized finite automaton
= Generalized finite automaton
= Generalized nondeterministic finite automaton
{synonym}
A finite directed automaton whose <edge> labels are <regular expressions> rather than individual letters. A path accepts concatenations of words in its successive labels, with choices over all accepting paths combined by <union>.