I’ve recently come across a few articles that talk about a “Generalized Transition Graph” (GTG), but I’ve never heard of such a thing before. This other answer to a similar question leads me to believe that GNFAs are simply GTGs with a different name where GNFA is the more standard nomenclature/name.
There is a Wikipedia article on GNFAs that describes them as:
…a variation of a nondeterministic finite automaton (NFA) where each transition is labeled with any regular expression.
which from what I understand is described by others as a GTG. Unfortunately, there’s no article on Generalized Transition Graphs on Wikipedia. The definitions for GTGs that I have come across are:
So again, are GNFAs the same as GTGs?