Determinization of transducers over finite and infinite words

Theoretical Computer Science

Volumn 289, Issue 1, 2002, Pages 225-251

  Béal, Marie Pierre ^a   Carton, Olivier ^a  

^a Université de Marne la Vallée   (France)

Author keywords

Automata; Determinization; Infinite words; Transducers

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; CHARACTERIZATION; COMPUTABILITY AND DECIDABILITY; FUNCTIONS; TRANSDUCERS;

INFINITE WORDS;

COMPUTER SCIENCE;

EID: 0037163943     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00271-7     Document Type: Article

References (30)

1. M.-P. Béal, Codage Symbolique, Masson, 1993.
2. M.-P. Béal, O. Carton, Computing the prefix of an automaton, Tech. Rep. 2000-08, Institut Gaspard Monge, 2000.
3. Béal M.-P., Carton O. Determinization of transducers over infinite words. Montanari U.et al. ICALP'2000. Lecture Notes in Computer Science. Vol. 1853: 2000; 561-570 Springer, Berlin.
4. Béal M.-P., Carton O., Prieur C., Sakarovitch J. Squaring transducers: an efficient procedure for deciding functionality and sequentiality. Gonnet G., Panario D., Viola A. LATIN'2000. Lecture Notes in Computer Science. Vol. 1776: 2000, 397-406 Springer, Berlin.
5. J. Berstel, Transductions and Context-Free Languages, B.G. Teubner, 1979.
6. J. Berstel, D. Perrin, Finite and infinite words, in: M. Lothaire (Ed.), Algebraic Combinatorics on Words, Cambridge, 1999, to appear.
7. Blattner M., Head T. Singled valued. a -transducers J. Comput. System Sci. 15: 1977; 310-327.
8. D. Breslauer, The suffix tree of a tree and minimizing sequential transducers, in: CPM'96, Lecture Notes in Computer Science, Vol. 1075, Springer, Berlin, 1996, pp. 116-129.
9. Breslauer D. The suffix tree of a tree and minimizing sequential transducers. Theoret. Comput. Sci. 191:1998;131-144.
10. O. Carton, C. Choffrut, C. Prieur, How to decide functionality of rational relations on infinite words, Preprint.
11. Choffrut C. Une caractérisation des fonctions séquentielles et des fonctions sous-séquentielles en tant que relations rationnelles. Theoret. Comput. Sci. 5: 1977; 325-338.
12. C. Choffrut, Contribution à l'étude de quelques familles remarquables de fonctions rationnelles, Thèse d'État Université Paris VII, 1978.
13. C. Choffrut, A generalization of Ginsburg and Rose's characterization of gsm mappings, in: ICALP'79 Lecture Notes in Computer Science, Vol. 71, Springer, Berlin, 1979, pp. 88-103.
14. A. Cohen, J.-F. Collard, Instance-wise reaching definition analysis for recursive programs using context-free transductions, in: PACT'98, 1998.
15. Eilenberg S. Automata, Languages and Machines, Vol. A. 1972;Academic Press, New York.
16. C. Frougny, Numeration systems, in: M. Lothaire (Ed.), Algebraic Combinatorics on Words, Cambridge, 1999, to appear.
17. Gire F. Two decidability problems for infinite words. Inform. Proc. Lett. 22:1986;135-140.
18. B. Kitchens, Continuity properties of factor maps in ergodic theory, Ph.D. Thesis, University of North Carolina, Chapel Hill, 1981.
19. Lind D., Marcus B. An Introduction to Symbolic Dynamics and Coding. 1995; Cambridge University Press, Cambridge.
20. Mohri M. Minimization of sequential transducers. Crochemore M., Gusfield D. CPM'94. Lecture Notes in Computer Science. Vol. 807:1994;151-163 Springer, Berlin.
21. Mohri M. On some applications of finite-state automata theory to natural languages processing. J. Natur. Language Eng. 2: 1996; 1-20.
22. Mohri M. Minimization algorithms for sequential transducers. Theoret. Comput. Sci. 234: 2000; 177-201.
23. Prieur C. How to decide continuity of rational functions on infinite words. Theoret. Comput. Sci. 250: 2001; 71-82.
24. E. Roche, Y. Schabes, Finite-State Language Processing, MIT Press, Cambridge, 1997 (Chapter 7).
25. S. Safra, On the complexity of ω-automata, 29th Ann. Symp. on Foundations of Computer Sciences, 1988, pp. 24-29.
26. Schütenberger M.-P. Sur les relations rationnelles. Brakhage H. Automata Theory and Formal Languages, 2nd GI Conference. Lecture Notes in Computer Science. Vol. 33: 1975; 209-213 Springer, Berlin.
27. Schütenberger M.-P. Sur une variante des fonctions séquentielles. Theoret. Comput. Sci. 11: 1977; 47-57.
28. Thomas W. Automata on infinite objects. van Leeuwen J. Handbook of Theoretical Computer Science, Vol. B. 1990; 133-191 Elsevier, Amsterdam.
29. A. Weber, R. Klemm, Economy of description for single-valued transducers, in: P. Enjalbert, E.W. Mayr, K.W. Wagner (Eds.), STACS'94, Lecture Notes in Computer Science, Vol. 775, Springer, Berlin, 1994, pp. 607-618.
30. Weber A., Klemm R. Economy of description for single-valued transducers. Inform. Comput. 118:1995;327-340.