Pseudo-minimal transducer

Theoretical Computer Science

Volumn 231, Issue 1, 2000, Pages 129-139

  Maurel, Denis ^a  

^a UNIVERSITÉ DE TOURS   (France)

Author keywords

ADFA; Electronic dictionary; Finite state automaton; Transducer

Indexed keywords

EID: 0003576383     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00022-5     Document Type: Article

References (10)

1. M. Gross, D. Perrin, Electronic Dictionnaries and Automata in Computational Linguistics, Lecture Notes in Computer Science, vol. 377, Springer, Berlin, 1989.
2. Hopcroft Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, MA, 1979.
3. D. Maurel, Building automaton on Schemata and Acceptability Tables, Lecture Notes in Computer Science, vol. 1260, Springer, Berlin, 1997, pp. 72-86.
4. D. Maurel, C. Belleil, E. Eggert, O. Piton, Le projet PROLEX, séminaire Représentations et Outils pour les Bases Lexicales, Morphologie Robuste de l'action Lexique du GDR-PRC CHM, Grenoble, 1996.
5. D. Maurel, C. Belleil, O. Piton, E. Eggert, Un dictionnaire électronique relationnel pour les noms propres, Revue française de Linguistique appliquée, 2-1 (1997) 101-111.
6. M. Mohri, Minimization of Sequential Transducers, Lecture Notes in Computer Science, Springer, Berlin, 1994a, p. 807.
7. M. Mohri, Finite-state transducers in language and speech processing, Comput. Linguistics 23-2 (1997) 269-311.
8. D. Revuz, Dictionnaries et lexiques - Méthodes et algorithmes, Doctoral dissertation in Computer Science, University of Paris, VII, 1991.
9. E. Roche, Y. Schabes (Ed.), Finite State Language Processing, MIT Press, Cambridge, MA, 1997.
10. B.W. Watson, Taxonomies and Toolkits of Regular Language Algorithms, Thesis, Technische Universiteit Eindhoven, 1995.