by D. Simplot, A. Terlutte, Bat M
Theoret. Inform. Appl
http://www.lifl.fr/~simplot/recherche/articles/S.ps.gz
Add To MetaCart
Abstract:
The purpose of this paper is to show connections between iterated length-preserving rational transductions and linear space computations. Hence, we study the smallest family of transductions containing lengthpreserving rational transductions and closed under union, composition and iteration. We give several characterizations of this class using restricted classes of length-preserving rational transductions, by showing the connections with "context-sensitive transductions " and transductions associated with recognizable picture languages. 1
Citations
|
228
|
Nondeterministic space is closed under complementation
– Immerman
- 1988
|
|
138
|
Signed-Digit Number Representations for Fast Parallel Arithmetic
– Avizienis
- 1961
|
|
91
|
Transductions and Context-Free Languages. Teubner Studienbucher
– Berstel
- 1979
|
|
47
|
Twodimensional languages
– Giammarresi, Restivo
- 1997
|
|
37
|
On relations defined by generalized finite automata
– ELGOT, MEZEI
- 1965
|
|
23
|
Classes of languages and linear-bounded automata
– Kuroda
- 1964
|
|
19
|
Recognizable picture languages and domino tiling
– Latteux, Simplot
- 1997
|
|
13
|
Some characterizations of functions computable in on-line arithmetic
– Muller
- 1994
|
|
9
|
Full AFL’s and nested iterated substitution
– Greibach
- 1970
|
|
8
|
Context-sensitive string languages and recognizable picture languages
– Latteux, Simplot
- 1997
|
|
7
|
Partial commutations and faithful rational transductions
– Clerbout, Latteux
- 1984
|
|
7
|
Transductions des langages de Chomsky. Ann. de l'Inst. Fourier 18
– Nivat
- 1968
|
|
5
|
Iterated length-preserving rational transductions
– Latteux, Simplot, et al.
- 1998
|
|
5
|
On characterizations of recursively enumerable languages
– Latteux, Turakainen
- 1990
|
|
5
|
The method of forced enumeration for nondeterministic automata
– enyi, R
- 1988
|
|
5
|
Iterated a-NGSM maps and \Gamma systems
– Wood
- 1976
|
|
2
|
Sur diverses familles de langages ferm'es par transductions rationnelles
– Boasson, Nivat
- 1973
|
|
2
|
Transductions rationnelles d'ecroissantes. RAIRO Informatique Th'eorique et
– Leguy
- 1981
|
|
2
|
Une g'en'eralisation des semi-commutations
– Lilin
- 1991
|
|
2
|
Sur les relations rationnelles entre monoides libres
– utzenberger, P
- 1976
|
|
2
|
Closure under union and composition of iterated rational transductions
– Simplot, Terlutte
- 2000
|
|
2
|
Transducers and compositions of morphisms and inverse morphisms. In Studies in honour of Arto Kustaa Salomaa on the occasion of his fiftieth birthday
– Turakainen
- 1984
|
|
1
|
Bifaithful stary transductions
– Latteux, Timmerman
- 1988
|
|
1
|
o M. A classification and closure properties of languages for describing concurrent system behaviours. Fundamenta Informaticae 4
– art'
- 1981
|
