Decomposition and factorization of sequential finite state machines
- 1 January 1989
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 8 (11), 1206-1217
- https://doi.org/10.1109/43.41505
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Addendum to 'A kernel-finding state assignment algorithm for multi-level logic'IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1989
- MUSTANG: state assignment of finite state machines targeting multilevel logic implementationsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1988
- ASYL: A Rule-Based System for Controller SynthesisIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1987
- Symbolic Design of Combinational and Sequential Logic Circuits Implemented by Two-Level Logic MacrosIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1986
- An implementation of a state assignment heuristicPublished by Association for Computing Machinery (ACM) ,1986
- Optimal State Assignment for Finite State MachinesIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1985
- An Algorithm for Finding Secondary Assignments of Synchronous Sequential CircuitsIEEE Transactions on Computers, 1968
- Some Techniques of State Assignment for Synchronous Sequential MachinesIEEE Transactions on Electronic Computers, 1964
- Secondary State Assignment for Sequential MachinesIEEE Transactions on Electronic Computers, 1964
- The Cascade Decomposition of Sequential MachinesIEEE Transactions on Electronic Computers, 1961