1 November 1990 State assignment algorithm for incompletely specified finite state machines
Author Affiliations +
Proceedings Volume 1405, 5th Congress of the Brazilian Society of Microelectronics; (1990) https://doi.org/10.1117/12.26306
Event: 5th Congress of the Brazilian Society of Microelectronics, 1990, Sao Paulo, Brazil
Abstract
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.
© (1990) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Jose Nelson Amaral, Wagner Chiepa Cunha, "State assignment algorithm for incompletely specified finite state machines", Proc. SPIE 1405, 5th Congress of the Brazilian Society of Microelectronics, (1 November 1990); doi: 10.1117/12.26306; https://doi.org/10.1117/12.26306
PROCEEDINGS
10 PAGES


SHARE
Back to Top