Theory and algorithms for state minimization of nondeterministic FSMs
- 1 January 1997
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 16 (11) , 1311-1322
- https://doi.org/10.1109/43.663820
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Verification of I/O trace set inclusion for a class of non-deterministic finite state machinesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- State minimization of pseudo non-deterministic FSMsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Nondeterministic finite-state machines and sequential don't caresPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Implicit manipulation of equivalence classes using binary decision diagramsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Exact and heuristic algorithms for the minimization of incompletely specified state machinesIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1994
- A fully implicit algorithm for exact state minimizationPublished by Association for Computing Machinery (ACM) ,1994
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986
- AN n log n ALGORITHM FOR MINIMIZING STATES IN A FINITE AUTOMATONPublished by Elsevier ,1971
- A Method for Minimizing the Number of Internal States in Incompletely Specified Sequential NetworksIEEE Transactions on Electronic Computers, 1965