35. The system of claim 32 , wherein operations to group states of the automaton together in a group instance based on a number of unused first instances include operations to: model the states as a graph wherein vertices of the graph correspond to states and edges of the graph correspond to possible pairings of the states; determine matching vertices for the graph; and pair states corresponding to the matching vertices.
36. The system of claim 35 , wherein operations to group states of the automaton together in a group instance based on a number of unused first instances include operations to: determine a maximum matching for the graph.