A proof of Choffrut's theorem on subsequential functions

Theoretical Computer Science

Volumn 215, Issue 1-2, 1999, Pages 329-335

  Bruyère, Véronique ^a   Reutenauer, Christophe ^b  

^a UNIVERSITY OF MONS   (Belgium)

^b Dept de Mathématiques ^*  (Canada)

Author keywords

Machine; Rational; Subsequential

Indexed keywords

EID: 0011967818     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00163-7     Document Type: Article

References (8)

1. J. Berstel, Transductions and context-free languages, Teubner, 1979.
2. D. Breslauer, The suffix tree of a tree and minimizing sequential transducers, Theoret. Comput. Sci. 191 (1998) 131-144.
3. C. Choffrut, A generalization of Ginsburg and Rose's characterization of g-s-m mappings, Lect. Notes Comput. Sci. 71 (1979) 88-103.
4. S. Eilenberg, Automata, Languages and Machines, vol. A, Academic Press, 1974.
5. D. Epstein, J. Cannon, D. Holt, S. Levy, M. Paterson, W. Thurston, Word Processing in Groups, Jones and Bartlett, Boston, London, 1992.
6. M. Mohri, Minimization algorithms for sequential transducers, Theoret. Comput. Sci. (1998) to appear.
7. C. Reutenauer, Subsequential functions: characterizations, minimization, examples, Lect. Notes Comput. Sci. 464 (1990) 62-79.
8. C. Reutenauer, M. Schützenberger, Minimization of rational word functions, SIAM J. Comput. 20 (1991) 669-685.