Minimisation of acyclic deterministic automata in linear time
- 6 January 1992
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 92 (1) , 181-189
- https://doi.org/10.1016/0304-3975(92)90142-3
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Three Partition Refinement AlgorithmsSIAM Journal on Computing, 1987
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986
- Partitioning a graph in O(¦A¦log2¦V¦)Theoretical Computer Science, 1982
- Finite Automata and Their Decision ProblemsIBM Journal of Research and Development, 1959
- The synthesis of sequential switching circuitsJournal of the Franklin Institute, 1954