Determinization of Transducers over Infinite Words: The General Case

Abstract We consider transducers over infinite words with a Büchi or a Muller acceptance condition. We give characterizations of functions that can be realized by Büchi and Muller sequential transducers. We describe an algorithm to determinize transducers defining functions over infinite words.

[1]  Albert Cohen,et al.  Instance-wise reaching definition analysis for recursive programs using context-free transductions , 1998, Proceedings. 1998 International Conference on Parallel Architectures and Compilation Techniques (Cat. No.98EX192).

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

[3]  Douglas Lind,et al.  An Introduction to Symbolic Dynamics and Coding , 1995 .

[4]  Christophe Prieur.  How to decide continuity of rational functions on infinite words , 2002, Theor. Comput. Sci..

[5]  Dany Breslauer.  The Suffix Tree of a Tree and Minimizing Sequential Transducers , 1998, Theor. Comput. Sci..

[6]  Olivier Carton,et al.  Determinization of transducers over finite and infinite words , 2002, Theor. Comput. Sci..

[7]  Françoise Gire.  Two Decidability Problems for Infinite Words , 1986, Inf. Process. Lett..

[8]  Reinhard Klemm,et al.  Economy of Description for Single-Valued Transducers , 1995, Inf. Comput..

[9]  Olivier Carton,et al.  Computing the prefix of an automaton , 2000, RAIRO Theor. Informatics Appl..

[10]  Emmanuel Roche,et al.  Finite-State Language Processing , 1997 .

[11]  Wolfgang Thomas,et al.  Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[12]  Wolfgang Thomas,et al.  Languages, Automata, and Logic , 1997, Handbook of Formal Languages.

[14]  M. Lothaire.  Algebraic Combinatorics on Words , 2002 .

[15]  Robert McNaughton,et al.  Testing and Generating Infinite Sequences by a Finite Automaton , 1966, Inf. Control..

[16]  Jacques Sakarovitch,et al.  Squaring transducers: an efficient procedure for deciding functionality and sequentiality , 2000, Theor. Comput. Sci..

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

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

[19]  Olivier Carton.  Computing the pre x of an automatonMarie-Pierre B , 2000 .

[20]  Mehryar Mohri,et al.  On some applications of finite-state automata theory to natural language processing , 1996, Nat. Lang. Eng..

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