We here study previous results due to Hopcroft and Almeida et al. to propose an incremental split-based deterministic automata minimization algorithm whose average running-time does not depend on the size of the alphabet. The experimentation carried out shows that our proposal outperforms the algorithms studied whenever the automata have more than a (quite small) number of states and symbols.
CITATION STYLE
García, P., de Parga, M. V., Velasco, J. A., & López, D. (2015). A Split-Based Incremental Deterministic Automata Minimization Algorithm. Theory of Computing Systems, 57(2), 319–336. https://doi.org/10.1007/s00224-014-9588-y
Mendeley helps you to discover research relevant for your work.