Minimisation of acyclic deterministic automata in linear time
Theoretical Computer Science - Selected papers of the Combinatorial Pattern Matching School
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Incremental construction of minimal acyclic finite-state automata
Computational Linguistics - Special issue on finite-state methods in NLP
Incremental construction of minimal deterministic finite cover automata
Theoretical Computer Science - Implementation and application of automata
On building minimal automaton for subset matching queries
Information Processing Letters
On the complexity of hopcroft’s state minimization algorithm
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
An incremental algorithm for constructing minimal deterministic finite cover automata
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Efficient error-tolerant query autocompletion
Proceedings of the VLDB Endowment
Cycle-aware minimization of acyclic deterministic finite-state automata
Discrete Applied Mathematics
| Hi-index | 0.00 |
This paper compares various methods for constructing minimal, deterministic, acyclic, finite-state automata (recognizers) from sets of words. Incremental, semi-incremental, and non-incremental methods have been implemented and evaluated.