A taxonomy of algorithms for constructing minimal acyclic deterministic finite automata

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

Volumn 2214, Issue , 2001, Pages 174-182

  Watson, Bruce W ^a,b  

^a UNIVERSITY OF PRETORIA   (South Africa)

^b Ribbit Software Systems Inc (IST Technologies Research Group)   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATIC INDEXING; COMPUTER VIRUSES; FINITE AUTOMATA; TAXONOMIES;

BIOLOGICAL VIRUS; DETERMINISTIC FINITE AUTOMATA; FINITE LANGUAGES; SPELL-CHECKING; TEXT-INDEXING;

BIOINFORMATICS;

EID: 84974678647     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45526-4_16     Document Type: Conference Paper

References (6)

1. Daciuk, J.D., Watson, B.W. and R.E. Watson. An Incremental Algorithm for Constructing Acyclic Deterministic Transducers. (Proceedings of the International Workshop on Finite State Methods in Natural Language Processing, Ankara, Turkey, 30 June–1 July 1998).
2. Dijkstra, E.W. A Discipline of Programming. (Prentice Hall, Englewood Cliffs, N.J., 1976).
3. Mihov, S. Direct Building of Minimal Automaton for Given List. (Available from stoyan@lml.acad.bg).
4. Revuz, D. Minimisation of acyclic deterministic automata in linear time. (Theoretical Computer Science 92, pp.181-189, 1992).
5. Watson, B.W. Taxonomies and Toolkits of Regular Language Algorithms. (Ph.D dissertation, Eindhoven University of Technology, The Netherlands, 1995).See www.OpenFIRE.org
6. Watson, B.W. A Fast New Semi-Incremental Algorithm for the Construction of Minimal Acyclic DFAs. (Proceedings of the Third Workshop on Implementing Automata, Rouen, France, September 1998).