A unified approach to the decomposition and re-decomposition of sequential machines
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Algebraic structure theory of sequential machines (Prentice-Hall international series in applied mathematics)
Fast Controllers for Data Dominated Applications
EDTC '97 Proceedings of the 1997 European conference on Design and Test
| Hi-index | 0.00 |
This paper describes a new FSM decomposition algorithm which extracts a data register from a given FSM. The algorithm is a generalization of the standard minimization algorithm--it selects output values which, when stored in a separate data register, will make additional states in the control machine equivalent. Experimental results show that the algorithm is both effective and fast.