License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.MFCS.2021.40
URN: urn:nbn:de:0030-drops-144805
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2021/14480/
Douéneau-Tabot, Gaëtan
Pebble Transducers with Unary Output
Abstract
Bojańczyk recently initiated an intensive study of deterministic pebble transducers, which are two-way automata that can drop marks (named "pebbles") on their input word, and produce an output word. They describe functions from words to words. Two natural restrictions of this definition have been investigated: marble transducers by Douéneau-Tabot et al., and comparison-free pebble transducers (that we rename here "blind transducers") by Nguyên et al.
Here, we study the decidability of membership problems between the classes of functions computed by pebble, marble and blind transducers that produce a unary output. First, we show that pebble and marble transducers have the same expressive power when the outputs are unary (which is false over non-unary outputs). Then, we characterize 1-pebble transducers with unary output that describe a function computable by a blind transducer, and show that the membership problem is decidable. These results can be interpreted in terms of automated simplification of programs.
BibTeX - Entry
@InProceedings{doueneautabot:LIPIcs.MFCS.2021.40,
author = {Dou\'{e}neau-Tabot, Ga\"{e}tan},
title = {{Pebble Transducers with Unary Output}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {40:1--40:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2021/14480},
URN = {urn:nbn:de:0030-drops-144805},
doi = {10.4230/LIPIcs.MFCS.2021.40},
annote = {Keywords: polyregular functions, pebble transducers, marble transducers, streaming string transducers, factorization forests}
}
Keywords: |
|
polyregular functions, pebble transducers, marble transducers, streaming string transducers, factorization forests |
Collection: |
|
46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021) |
Issue Date: |
|
2021 |
Date of publication: |
|
18.08.2021 |