Minimizing resources of sweeping and streaming string transducers - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

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.
Fichier principal
Vignette du fichier
long-version.pdf (605.91 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01274992 , version 1 (16-02-2016)
hal-01274992 , version 2 (18-02-2016)
hal-01274992 , version 3 (06-12-2016)

Licence

Attribution

Identifiers

Cite

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⟩

Collections

CNRS ANR
511 View
197 Download

Altmetric

Share

Gmail Facebook X LinkedIn More