| Issue |
RAIRO-Theor. Inf. Appl.
Volume 34, Number 2, March/April 2000
|
|
|---|---|---|
| Page(s) | 99 - 129 | |
| DOI | https://doi.org/10.1051/ita:2000109 | |
| Published online | 15 April 2002 | |
Iteration of rational transductions
1
UPRESA 8022 du CNRS, LIFL, Université de Lille I, bâtiment
M3, Cité Scientifique, 59655 Villeneuve-d'Ascq Cedex, France;
(terlutte@lifl.fr)
2
UPRESA 8022 du CNRS, LIFL, Université de Lille I, bâtiment
M3, Cité Scientifique, 59655 Villeneuve-d'Ascq Cedex, France;
(simplot@lifl.fr)
Received:
20
March
1999
Accepted:
5
March
2000
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 length-preserving 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.
Mathematics Subject Classification: 68Q45 / 68Q42 / 68Q70
© EDP Sciences, 2000
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.