DocumentCode
2618670
Title
New approach to the state reduction in incompletely specified sequential machines
Author
Avedillo, María J. ; Quintana, J.M. ; Huertas, J.L.
Author_Institution
Dept. de Electron. y Electromagn., Sevilla Univ., Spain
fYear
1990
fDate
1-3 May 1990
Firstpage
440
Abstract
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
Keywords
finite automata; logic CAD; logic arrays; logic design; sequential machines; finite state machine; heuristic method; incompletely specified sequential machines; state reduction; symbolic description; Automata; Automatic control; Circuit testing; Control system synthesis; Digital systems; Logic; Minimization; NP-complete problem; Sequential analysis; Sequential circuits;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 1990., IEEE International Symposium on
Conference_Location
New Orleans, LA
Type
conf
DOI
10.1109/ISCAS.1990.112075
Filename
112075
Link To Document