{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T14:24:08Z","timestamp":1777645448174,"version":"3.51.4"},"reference-count":0,"publisher":"SAGE Publications","issue":"1-2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["FI"],"published-print":{"date-parts":[[2021,1,13]]},"abstract":"<jats:p>Copyless streaming string transducers (copyless SST) have been introduced by R. Alur and P. \u010cern\u00fd in 2010 as a one-way deterministic automata model to define transductions of finite strings. Copyless SST extend deterministic finite state automata with a set of variables in which to store intermediate output strings, and those variables can be combined and updated all along the run, in a linear manner, i.e., no variable content can be copied on transitions. It is known that copyless SST capture exactly the class of MSO-definable string-to-string transductions, and are as expressive as deterministic two-way transducers. They enjoy good algorithmic properties. Most notably, they have decidable equivalence problem (in PSpace). On the other hand, HDT0L systems have been introduced for a while, the most prominent result being the decidability of the equivalence problem. In this paper, we propose a semantics of HDT0L systems in terms of transductions, and use it to study the class of deterministic copyful SST. Our contributions are as follows: (i)HDT0L systems and total deterministic copyful SST have the same expressive power, (ii)the equivalence problem for deterministic copyful SST and the equivalence problem for HDT0L systems are inter-reducible, in quadratic time. As a consequence, equivalence of deterministic SST is decidable, (iii)the functionality of non-deterministic copyful SST is decidable, (iv)determining whether a non-deterministic copyful SST can be transformed into an equivalent non-deterministic copyless SST is decidable in polynomial time.<\/jats:p>","DOI":"10.3233\/fi-2021-1998","type":"journal-article","created":{"date-parts":[[2021,1,15]],"date-time":"2021-01-15T12:18:13Z","timestamp":1610713093000},"page":"59-76","source":"Crossref","is-referenced-by-count":1,"title":["Copyful Streaming String Transducers"],"prefix":"10.1177","volume":"178","author":[{"given":"Emmanuel","family":"Filiot","sequence":"first","affiliation":[{"name":"Universit\u00e9 libre de Bruxelles (U.L.B.), Belgium. efiliot@ulb.ac.be"}]},{"given":"Pierre-Alain","family":"Reynier","sequence":"additional","affiliation":[{"name":"Aix Marseille Univ, Universit\u00e9 de Toulon, CNRS, LIS, Marseille, France. pierre-alain.reynier@univ-amu.fr"}]}],"member":"179","container-title":["Fundamenta Informaticae"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/FI-2021-1998","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T06:32:15Z","timestamp":1777444335000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/FI-2021-1998"}},"subtitle":[],"editor":[{"given":"Matthew","family":"Hague","sequence":"additional","affiliation":[]},{"given":"Igor","family":"Potapov","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2021,1,13]]},"references-count":0,"journal-issue":{"issue":"1-2"},"URL":"https:\/\/doi.org\/10.3233\/fi-2021-1998","relation":{},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"value":"0169-2968","type":"print"},{"value":"1875-8681","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,13]]}}}