@inproceedings{10.1007/978-3-319-67089-8_6,
    Abstract = {Copyless streaming string transducers (copyless SST) have been introduced by R. Alur and P. {\v{C}}ern{\'y} 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).},
    Address = {Cham},
    Author = {Filiot, Emmanuel and Reynier, Pierre-Alain},
    BookTitle = {Reachability Problems},
    Editor = {Hague, Matthew and Potapov, Igor},
    File = {rp17 (0) (0) - a - a - k.pdf},
    ISBN = {978-3-319-67089-8},
    Pages = {75--86},
    Publisher = {Springer International Publishing},
    Title = {Copyful Streaming String Transducers},
    Year = {2017},
    date-added = {2019-04-08 15:01:54 +0200},
    date-modified = {2019-04-08 15:01:54 +0200},
    doi = {10.1007/978-3-319-67089-8_6}
}

@inproceedings{10.1007/978-3-319-67089-8_6, Abstract = {Copyless streaming string transducers (copyless SST) have been introduced by R. Alur and P. {\v{C}}ern{\'y} 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).}, Address = {Cham}, Author = {Filiot, Emmanuel and Reynier, Pierre-Alain}, BookTitle = {Reachability Problems}, Editor = {Hague, Matthew and Potapov, Igor}, File = {rp17 (0) (0) - a - a - k.pdf}, ISBN = {978-3-319-67089-8}, Pages = {75--86}, Publisher = {Springer International Publishing}, Title = {Copyful Streaming String Transducers}, Year = {2017}, date-added = {2019-04-08 15:01:54 +0200}, date-modified = {2019-04-08 15:01:54 +0200}, doi = {10.1007/978-3-319-67089-8_6} }