State assignment algorithm for incompletely specified finite state machines

Jose Nelson Amaral; Wagner Chiepa Cunha

doi:10.1117/12.26306

1 November 1990 State assignment algorithm for incompletely specified finite state machines

Jose Nelson Amaral, Wagner Chiepa Cunha

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.

Citation Download Citation

Jose Nelson Amaral and 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); https://doi.org/10.1117/12.26306

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available