Copyful Streaming String Transducers

• Published in: Fundamenta informaticae Vol. 178; no. 1-2; pp. 59 - 76
• Main Authors: Filiot, Emmanuel, Reynier, Pierre-Alain
• Format: Journal Article
• Language: English
• Published: London, England SAGE Publications 13.01.2021; Sage Publications Ltd; Polskie Towarzystwo Matematyczne
• Subjects: Automata theory; Computer Science; Equivalence; Logic in Computer Science; Polynomials; Semantics; Strings; Transducers; words; equivalence problem; transducers
• ISSN: 0169-2968; 1875-8681; 1875-8681
• DOI: 10.3233/FI-2021-1998

Copyless streaming string transducers (copyless SST) have been introduced by R. Alur and P. Černý 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: HDT0L systems and total deterministic copyful SST have the same expressive power, 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, the functionality of non-deterministic copyful SST is decidable, determining whether a non-deterministic copyful SST can be transformed into an equivalent non-deterministic copyless SST is decidable in polynomial time.