LIPIcs.ICALP.2023.117.pdf
- Filesize: 0.93 MB
- 19 pages
We consider regular string-to-string functions, i.e. functions that are recognized by copyless streaming string transducers, or any of their equivalent models, such as deterministic two-way automata. We give yet another characterization, which is very succinct: finiteness-preserving functors from the category of semigroups to itself, together with a certain output function that is a natural transformation.
Feedback for Dagstuhl Publishing