On the follower set graph of shifts of finite type

Constrained sequences have been used in many storage systems as well as in data transmission schemes. These sequences are usually described by a deterministic graph. The graph with the fewest vertices is obtained, in general, via a two-step procedure: The first step is to generate an initial graph, and the second one is to apply a vertex-minimization algorithm to identify classes of equivalent vertices. Applying the new concept of constraint set this work presents a new splitting algorithm to determine the vertices of the minimal presentation without determining an initial graph. Thus the transition function that connects the vertices is calculated over a smaller set, reducing the computation efforts for constructing this graph.