论文信息 - Squaring Transducers: An Efficient Procedure for Deciding Functionality and Sequentiality of Transducers

Squaring Transducers: An Efficient Procedure for Deciding Functionality and Sequentiality of Transducers

We described here a construction on transducers that give a new conceptual proof for two classical decidability results on transducers: it is decidable whether a finite transducer realizes a functional relation, and whether a finite transducer realizes a sequential relation. A better complexity follows then for the two decision procedures.

[1] Marcel Paul Schützenberger,et al. Sur une Variante des Fonctions Sequentielles , 1977, Theor. Comput. Sci..

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

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

[4] Véronique Bruyère,et al. A Proof of Choffrut's Theorem on Subsequential Functions , 1999, Theor. Comput. Sci..

[5] Meera Blattner. Single-Valued a-Transducers , 1977, J. Comput. Syst. Sci..

[6] Umberto Eco,et al. Theory of Codes , 1976 .

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

[8] Christian Choffrut,et al. Une Caracterisation des Fonctions Sequentielles et des Fonctions Sous-Sequentielles en tant que Relations Rationnelles , 1977, Theor. Comput. Sci..

[9] Marcel Paul Schützenberger,et al. Sur les relations rationnelles , 1975, Automata Theory and Formal Languages.

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

[11] Robin Milner,et al. On Observing Nondeterminism and Concurrency , 1980, ICALP.