A fast new semi-incremental algorithm for the construction of minimal acyclic DFAs

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

Volumn 1660, Issue , 1999, Pages 121-132

  Watson, Bruce W ^a,b  

^a UNIVERSITY OF PRETORIA   (South Africa)

^b INSTITUTO SUPERIOR TÉCNICO   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ALGORITHM DERIVATION; CORRECTNESS ARGUMENT; DETERMINISTIC FINITE AUTOMATA; INCREMENTAL ALGORITHM; RUNNING TIME; SEPARATE ALGORITHM; SPELL-CHECKING;

ALGORITHMS;

EID: 84911114815     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48057-9_11     Document Type: Conference Paper

References (4)

1. Daciuk, J.D., Watson, B.W. and R.E. Watson. An Incremental Algorithm for Con- structing 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. Revuz, D. Dictionnaires et lexiques: méthodes et algorithmes. (Ph.D dissertation, Institut Blaise Pascal, LITP 91.44, Paris, France, 1991).
4. Watson, B.W. Taxonomies and Toolkits of Regular Language Algorithms. (Ph.D dissertation, Eindhoven University of Technology, The Netherlands, 1995). See www.RibbitSoft.com/research/watson