Abstract : 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.
https://hal.archives-ouvertes.fr/hal-01431250
Contributeur : Gabriele Puppis
<>
Soumis le : mardi 10 janvier 2017 - 16:16:46
Dernière modification le : mardi 3 juillet 2018 - 11:40:40
Document(s) archivé(s) le : mardi 11 avril 2017 - 16:11:45
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. 2017, 〈https://stacs2017.thi.uni-hannover.de/〉. 〈10.4230/LIPIcs〉. 〈hal-01431250〉
