Displaying similar documents to “Closure under union and composition of iterated rational transductions”

Radix enumeration of rational languages

Pierre-Yves Angrand, Jacques Sakarovitch (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

We prove that the function that maps a word of a rational language onto its successor for the radix order in this language is a finite union of co-sequential functions.

Iteration of rational transductions

Alain Terlutte, David Simplot (2000)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

Closure under union and composition of iterated rational transductions

D. Simplot, A. Terlutte (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

We proceed our work on iterated transductions by studying the closure under union and composition of some classes of iterated functions. We analyze this closure for the classes of length-preserving rational functions, length-preserving subsequential functions and length-preserving sequential functions with terminal states. All the classes we obtain are equal. We also study the connection with deterministic context-sensitive languages.