Direct construction of minimal acyclic subsequential transducers

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

Volumn 2088, Issue , 2001, Pages 217-229

  Mihov, Stoyan ^a   Maurel, Denis ^b  

^a BULGARIAN ACADEMY OF SCIENCES   (Bulgaria)

^b UNIVERSITÉ DE TOURS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; NATURAL LANGUAGE PROCESSING SYSTEMS; TREES (MATHEMATICS);

EXPERIMENTAL COMPARISON; NATURAL LANGUAGE DICTIONARIES;

TRANSDUCERS;

EID: 84954446605     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44674-5_18     Document Type: Conference Paper

References (8)

1. A. Aho, J. Hopcroft, J. Ullman, Data Structures and Algorithms, Addison-Wesley, Reading, Massachutes, 1983.
2. J. Daciuk, S. Mihov, B. Watson, R. Watson, Incremental Construction of Minimal Acyclic Finite State Automata, Computational Linguistics, Vol. 26(1), 2000.
3. D. Maurel, Pseudo-minimal transducer, Theoretical Computer Science, Vol. 231(1), 129-139, 2000.
4. S. Mihov, Direct Building of Minimal Automaton for Given List, Annuaire de l'Université de Sofia “St. Kl. Ohridski”, Faculté de Mathématique et Informatique, volume 91, livre 1, 1998.
5. M. Mohri, Minimization of Sequential Transducers, Lecture Notes in Computer Science, Springer, Berlin, 1994.
6. M. Mohri, On Some Applications of Finite-State Automata Theory to Natural Language Processing, Natural Language Engineering, Vol. 2(1), 1-20, 1996.
7. M. Mohri, Finite-State Transducers in Language and Speech Processing, Compu-tational Linguistics, Vol. 23(2), 269-311, 1997.
8. D. Revuz, Dictionaires et lexiques - Méthodes et algorithmes, Doctoral dissertation in Computer Science, University Paris VII, Paris, 1991.