Minimal coverings for incompletely specified sequential machines
- 1 March 1986
- journal article
- Published by Springer Nature in Acta Informatica
- Vol. 22 (6) , 663-678
- https://doi.org/10.1007/bf00263650
Abstract
No abstract availableKeywords
This publication has 46 references indexed in Scilit:
- Partial abstract typesActa Informatica, 1982
- Minimisation of incompletely specified sequential machines: the ‘really’ excluded compatibility classesElectronics Letters, 1979
- An Efficient State Minimization Algorithm for Some Special Classes of Incompletely Specified Sequential MachinesIEEE Transactions on Computers, 1979
- A computer algorithm for state table reductionRadio and Electronic Engineer, 1972
- AN n log n ALGORITHM FOR MINIMIZING STATES IN A FINITE AUTOMATONPublished by Elsevier ,1971
- Minimal solutions of Paull-Unger problemsTheory of Computing Systems, 1969
- Minimum-State Sequential Circuits for a Restricted Class of Incompletely Specified Flow Tables*Bell System Technical Journal, 1962
- Compatibility of States in Input-Independent MachinesJournal of the ACM, 1961
- Connective Properties Preserved in Minimal State MachinesJournal of the ACM, 1960
- On the Reduction of Superfluous States in a Sequential MachineJournal of the ACM, 1959