State assignment algorithm for incompletely specified finite state machines
José Nelson Amaral, Wagner Chiepa Cunha · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 1990
This paper presents an algorithm for state assignment in incompletely specified finite state machines, based on a set of heuristic rules. These rules are used to build a desired adjacency graph in which a weight is associated to each possible adjacency. A new method of assigning codes to each state is presented with the goal of choosing adjacencies with large weights.