Iterated Length-Preserving Rational Transductions

The purpose of this paper is the study of the smallest family of transductions containing length-preserving rational transductions and closed under union, composition and iteration. We give several characterizations of this class using restricted classes of length-preserving transductions, by showing the connections with “context-sensitive transductions” and transductions associated with recognizable picture languages. We also study the class obtained by only using length-preserving rational functions and we show the relations with “deterministic context-sensitive transductions”.

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

[2]  Michel Latteux,et al.  Recognizable Picture Languages and Domino Tiling , 1997, Theor. Comput. Sci..

[3]  Michel Latteux,et al.  Context-Sensitive String Languages and Eecognizable Picture Languages , 1997, Inf. Comput..

[4]  Michel Latteux,et al.  A New Proof of two Theorems about Rational Transductions , 1979, Theor. Comput. Sci..

[5]  Grzegorz Rozenberg,et al.  Handbook of Formal Languages , 1997, Springer Berlin Heidelberg.

[6]  Antonio Restivo,et al.  Two-Dimensional Languages , 1997, Handbook of Formal Languages.

[7]  Sheila A. Greibach.  Full AFLs and Nested Iterated Substitution , 1970, Inf. Control..

[8]  A. Avizeinis,et al.  Signed Digit Number Representations for Fast Parallel Arithmetic , 1961 .

[9]  Jorge E. Mezei,et al.  On Relations Defined by Generalized Finite Automata , 1965, IBM J. Res. Dev..

[10]  Marcel Paul Schützenberger,et al.  Sur les Relations Rationnelles Entre Monoides Libres , 1976, Theor. Comput. Sci..

[11]  S.-Y. Kuroda,et al.  Classes of Languages and Linear-Bounded Automata , 1964, Inf. Control..

[12]  Neil Immerman.  Nondeterministic Space is Closed Under Complementation , 1988, SIAM J. Comput..

[13]  Derick Wood.  Iterated a-NGSM Maps and \Gamma Systems , 1976, Inf. Control..

[14]  Jesse B. Wright,et al.  Algebraic Automata and Context-Free Sets , 1967, Inf. Control..

[15]  Jean-Michel Muller.  Some Characterizations of Functions Computable in On-Line Arithmetic , 1994, IEEE Trans. Computers.

[16]  Maurice Nivat,et al.  Transduction des langages de Chomsky , 1968 .

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