Comparison of construction algorithms for minimal, acyclic, deterministic, finite-state automata from sets of strings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2608, Issue , 2003, Pages 255-261

  Daciuk, Jan ^a  

^a UNIVERSITY OF GRONINGEN   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

FINITE AUTOMATA;

CONSTRUCTION ALGORITHMS; INCREMENTAL METHOD;

ROBOTS;

EID: 33745141937     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44977-9_26     Document Type: Review

References (7)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley Publishing Company, 1974.
2. Jan Daciuk, Stoyan Mihov, Bruce Watson, and Richard Watson. Incremental construction of minimal acyclic finite state automata. Computational Linguistics, 26(1):3-16, April 2000.
3. John E. Hopcroft. An n log n algorithm for minimizing the states in a finite automaton. In Z. Kohavi, editor, The Theory of Machines and Computations, pages 189-196. Academic Press, 1971.
4. Dominique Revuz. Dictionnaires et lexiques: méthodes et algorithmes. PhD thesis, Institut Blaise Pascal, Paris, France, 1991. LITP 91.44.
5. Dominique Revuz. Minimisation of acyclic deterministic automata in linear time. Theoretical Computer Science, 92(1):181-189, 1992.
6. Max Silberztein. INTEX tutorial notes. In Workshop on Implementing Automata WIA99 - Pre-Proceedings, pages XIX-1-XIX-31. 1999.
7. Bruce Watson. A fast new (semi-incremental) algorithm for the construction of minimal acyclic DFAs. In Third Workshop on Implementing Automata, pages 91-98, Rouen, France, September 1998. Lecture Notes in Computer Science, Springer.