Squaring transducers: An efficient procedure for deciding functionality and sequentiality

Theoretical Computer Science

Volumn 292, Issue 1, 2003, Pages 45-63

  Béal, Marie Pierre ^a   Carton, Olivier ^a   Prieur, Christophe ^b   Sakarovitch, Jacques ^c  

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

^b UNIVERSITÉ PARIS DIDEROT   (France)

^c CNRS   (France)

Author keywords

Finite automata; Functional transducer; Sequential transducer

Indexed keywords

ALGORITHMS; COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; THEOREM PROVING;

SEQUENTIAL TRANSDUCERS;

FINITE AUTOMATA;

EID: 0037427698     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00214-6     Document Type: Article

References (15)

1. M.-P. Béal, O. Carton, Determinization of transducers over finite and infinite words, to appear in Theoret. Comput. Sci.
2. Béal M.-P., Carton O., Prieur C., Sakarovitch J. Squaring transducers. Gonnet G., Panario D., Viola A. Proc. LATIN 2000. Lecturer Notes in Computer Science. vol. 1776:2000;397-406 Springer, Berlin.
3. Berstel J. Transductions and Context-free Languages. 1979;Teubner, Leipzig.
4. Berstel J., Perrin D. Theory of Codes. 1985;Academic Press, New York.
5. Blattner M., Head T. Single valued. a -transducers J. Comput. System Sci. 7:1977;310-327.
6. Bruyère V., Reutenauer Ch. A proof of Choffrut's theorem on subsequential functions. Theoret. Comput. Sci. 215:1999;329-335.
7. Carton O., Choffrut Ch., Prieur Ch. How to decide functionality and continuity of rational relations on infinite words. Theoret. Comput. Sci. 250:2001;71-82.
8. Choffrut Ch. Une caractérisation des fonctions séquentielles et des fonctions sous-séquentielles en tant que relations rationnelles. Theoret. Comput. Sci. 5:1977;325-337.
9. Choffrut Ch. A generalization of Ginsburg and Rose's characterization of g-s-m mappings. Maurer H. Proc. of ICALP'79. Lecture Notes in computer Science. Vol. 71:1979;88-103.
10. Eilenberg S. Automata, Languages and Machines, Vol. A. 1974;Academic Press, New York.
11. Gurari E.M., Ibarra O.H. Finite-valued and finitely ambiguous transducers. Math. Systems Theory. 16:1983;61-66.
12. Ch. Reutenauer, Subsequential functions: characterizations, minimization, examples, Lecture Notes in Computer Science, Vol. 464, Springer, Berlin, 1990, pp. 62-79.
13. Schützenberger M.P. Sur les relations rationnelles. Brackhage H. Automata Theory and Formal Languages. Lecture Notes in Computer Science. Vol. 33:1975;209-213 Springer, Berlin.
14. Schützenberger M.P. Sur une variante des fonctions séquentielles. Theoret. Comput. Sci. 4:1977;47-57.
15. Weber A., Klemm R. Economy of description for single-valued transducers. Inform. and Comput. 118:1995;327-340.