Construction of push-down automaton graph (Q1281236)

The author considers a method of transformation of a shop automaton into another description of acceptable by the automaton language -- D-graph. D-graph construction algorithm follows from the definition of so called automaton's basis: By iterating a finite set of paths of D-graph is constructed and the graph itself is determined by nodes and branches represented in these paths. The set of paths mentioned above is minimal in a certain sense for graph construction.