On the decomposition of finite-valued streaming string transducers - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

On the decomposition of finite-valued streaming string transducers

Résumé

We prove the following decomposition theorem: every 1-register streaming string transducer that associates a uniformly bounded number of outputs with each input can be effectively decomposed as a finite union of functional 1-register streaming string transducers. This theorem relies on a combinatorial result by Kortelainen concerning word equations with iterated factors. Our result implies the decidability of the equivalence problem for the considered class of transducers. This can be seen as a first step towards proving a more general decomposition theorem for streaming string transducers with multiple registers.
Fichier principal
Vignette du fichier
STACS 2017.pdf (561.7 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01431250 , version 1 (10-01-2017)

Identifiants

Citer

Paul Gallot, Anca Muscholl, Gabriele Puppis, Sylvain Salvati. On the decomposition of finite-valued streaming string transducers. 34th International Symposium on Theoretical Aspects of Computer Science (STACS), Mar 2017, Hannover, Germany. ⟨10.4230/LIPIcs⟩. ⟨hal-01431250⟩
259 Consultations
89 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More