Abstract

The purpose of this paper is to show connections between iterated length-preserving rational and linear space computations. Hence, we study the smallest family of containing length-preserving rational 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 associated with recognizable picture languages.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call