Closure under union and composition of iterated rational transductions
D. Simplot, A. Terlutte (2000)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “Bijective sequential mappings of a free monoid onto another”
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.
On parallel deletions applied to a word
Lila Kari, Alexandru Mateescu, Gheorghe Paun, Arto Salomaa (1995)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Sequential mappings of -languages
Ludwig Staiger (1987)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
A combinatorial theorem on -power-free words and an application to semigroups
Aldo de Luca, Stefano Varricchio (1990)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Minimum complexity of automatic non sturmian sequences
T. Tapsoba (1995)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: