On VLSI decompositions for deBruijn graphs

A VLSI decomposition of a graph G is a collection of isomorphic vertex-disjoint subgraphs (called building blocks) of G which together span G. This paper gives a necessary condition and a sufficient condition for a graph to be a building block for deBruijn graphs, which are used to build Viterbi decoders.