Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/s00224-014-9588-y | Theory of Computing Systems |
Keywords | Field | DocType |
Finite automata,DFA minimization,Incremental minimization | Discrete mathematics,Quantum finite automata,Combinatorics,Automaton,Algorithm,Finite-state machine,DFA minimization,Minimization algorithm,Mathematics,Alphabet | Journal |
Volume | Issue | ISSN |
57 | 2 | 1432-4350 |
Citations | PageRank | References |
1 | 0.35 | 7 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pedro García | 1 | 45 | 10.89 |
| Manuel Vazquez de Parga | 2 | 36 | 6.71 |
| Jairo Andrés Velasco | 3 | 2 | 1.17 |
| Damián López | 4 | 105 | 13.38 |