Share Email Print

Proceedings Paper

State assignment algorithm for incompletely specified finite state machines
Author(s): Jose Nelson Amaral; Wagner Chiepa Cunha
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 1 November 1990
PDF: 10 pages
Proc. SPIE 1405, 5th Congress of the Brazilian Society of Microelectronics, (1 November 1990); doi: 10.1117/12.26306
Show Author Affiliations
Jose Nelson Amaral, Pontificia Univ. Catolica do Rio Grande do Sul (Brazil)
Wagner Chiepa Cunha, Instituto Tecnologico de Aeronautical (Brazil)

Published in SPIE Proceedings Vol. 1405:
5th Congress of the Brazilian Society of Microelectronics
Vitor Baranauskas, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?