We consider vertex decompositions of (di)graphs appearing in the automata theory and establish some properties of these decompositions. These decompositions are applied to the problem of forbidden subgraphs.
Published in Ukrains’kyi Matematychnyi Zhurnal, Vol. 66, No. 7, pp. 958–969, July, 2014.