论文信息 - A Proof of Choffrut's Theorem on Subsequential Functions - 字舞流文

A Proof of Choffrut's Theorem on Subsequential Functions

We prove an extension of the Ginsburg-Rose theorem, and as a corollary, Choffrut's topological characterization of subsequential functions.

Véronique Bruyère | Christophe Reutenauer | C. Reutenauer | V. Bruyère

[1] David B. A. Epstein,et al. Word processing in groups , 1992 .

[2] Christophe Reutenauer,et al. Subsequential Functions: Characterizations, Minimization, Examples , 1990, International Meeting of Young Computer Scientists.

[3] Christian Choffrut,et al. A Generalization of Ginsburg and Rose's Characterization of G-S-M Mappings , 1979, ICALP.

[4] Mehryar Mohri,et al. Minimization algorithms for sequential transducers , 2000, Theor. Comput. Sci..

[5] Jean Berstel,et al. Transductions and context-free languages , 1979, Teubner Studienbücher : Informatik.

[6] Samuel Eilenberg,et al. Automata, languages, and machines. A , 1974, Pure and applied mathematics.

[7] Christophe Reutenauer,et al. Minimization of Rational Word Functions , 1991, SIAM J. Comput..

[8] Thomas Sudkamp,et al. Languages and Machines , 1988 .

[9] Dany Breslauer. The suffix Tree of a Tree and Minimizing Sequential Transducers , 1996, CPM.