Referenced Items are not available for this document.
An algorithm for the state reduction of incompletely specified sequential machines is presented. The heuristic method does not need to generate any complete set of compatibles. Starting from the set of internal states in the given symbolic description of the finite state machine (FSM), the application of a sequence of transformations results in a description with a smaller number of states. Experimental results for a wide set of machines are included which prove the superiority of the algorithm
Published in:
Circuits and Systems, 1990., IEEE International Symposium on
Date of Conference: 1-3 May 1990
- Page(s):
- 440 - 443 vol.1
- Meeting Date :
- 01 May 1990-03 May 1990
- INSPEC Accession Number:
- 3842629
- Conference Location :
- New Orleans, LA
- Digital Object Identifier :
- 10.1109/ISCAS.1990.112075
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
