Minimizing resources of sweeping and streaming string transducers

Abstract : We consider minimization problems for natural parameters of word transducers: the number of passes performed by two-way transducers and the number of registers used by streaming transducers. We show how to compute in ExpSpace the minimum number of passes needed to implement a transduction given as sweeping transducer, and we provide effective constructions of transducers of (worst-case optimal) doubly exponential size. We then consider streaming transducers where concatenations of registers are forbidden in the register updates. Based on a correspondence between the number of passes of sweeping transducers and the number of registers of equivalent concatenation-free streaming transducers, we derive a minimization procedure for the number of registers of concatenation-free streaming transducers.
Document type :
Conference papers
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download
Contributor : Olivier Gauwin <>
Submitted on : Tuesday, December 6, 2016 - 2:38:21 PM
Last modification on : Thursday, August 30, 2018 - 1:58:01 PM
Long-term archiving on : Tuesday, March 21, 2017 - 3:52:54 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License




Félix Baschenis, Olivier Gauwin, Anca Muscholl, Gabriele Puppis. Minimizing resources of sweeping and streaming string transducers. 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), Jul 2016, Rome, Italy. pp.114:1--114:14, ⟨10.4230/LIPIcs.ICALP.2016.114⟩. ⟨hal-01274992v3⟩



Record views


Files downloads