Document Open Access Logo

Reversible Pebble Transducers

Authors Luc Dartois , Paul Gastin , Loïc Germerie Guizouarn , Shankaranarayanan Krishna

PDF

File

Thumbnail PDF
PDF
LIPIcs.CONCUR.2025.14.pdf
  • Filesize: 0.95 MB
  • 22 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Transducers
Keywords
  • Transducers
  • Polyregular functions
  • Reversibility
  • Composition
  • Uniformization

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

Deterministic two-way transducers with pebbles (aka pebble transducers) capture the class of polyregular functions, which extend the string-to-string regular functions allowing polynomial growth instead of linear growth. One of the most fundamental operations on functions is composition, and (poly)regular functions can be realized as a composition of several simpler functions. In general, composition of deterministic two-way transducers incur a doubly exponential blow-up in the size of the inputs. A major improvement in this direction comes from the fundamental result of Dartois et al. [Luc Dartois et al., 2017] showing a polynomial construction for the composition of reversible two-way transducers. 
A precise complexity analysis for existing composition techniques of pebble transducers is missing. But they rely on the classic composition of two-way transducers and inherit the double exponential complexity. To overcome this problem, we introduce reversible pebble transducers. Our main results are efficient uniformization techniques for non-deterministic pebble transducers to reversible ones and efficient composition for reversible pebble transducers.

Cite As Get BibTex

Luc Dartois, Paul Gastin, Loïc Germerie Guizouarn, and Shankaranarayanan Krishna. Reversible Pebble Transducers. In 36th International Conference on Concurrency Theory (CONCUR 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 348, pp. 14:1-14:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.CONCUR.2025.14

Author Details

Luc Dartois
  • Université Paris Est Creteil, LACL, F-94010 Créteil, France
Paul Gastin
  • Université Paris-Saclay, ENS Paris-Saclay, CNRS, LMF, 91190, Gif-sur-Yvette, France
  • CNRS, ReLaX, IRL 2000, Siruseri, India
Loïc Germerie Guizouarn
  • Univ Rennes, CNRS, Inria, IRISA - UMR 6074, F-35000 Rennes, France
Shankaranarayanan Krishna
  • Indian Institute of Technology Bombay, Mumbai, India

References

  1. Rajeev Alur and Pavol Černý. Expressiveness of streaming string transducers. In 30th International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, volume 8 of LIPIcs. Leibniz Int. Proc. Inform., pages 1-12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. URL: https://doi.org/10.4230/LIPICS.FSTTCS.2010.1.
  2. Rajeev Alur, Adam Freilich, and Mukund Raghothaman. Regular combinators for string transformations. In Thomas A. Henzinger and Dale Miller, editors, Joint Meeting of the 23rd EACSL Annual Conference on Computer Science Logic (CSL) and the 29th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, Vienna, Austria, July 14 - 18, 2014, pages 9:1-9:10. ACM, 2014. URL: https://doi.org/10.1145/2603088.2603151.
  3. Nicolas Baudru and Pierre-Alain Reynier. From two-way transducers to regular function expressions. In Mizuho Hoshi and Shinnosuke Seki, editors, 22nd International Conference on Developments in Language Theory, DLT 2018, volume 11088 of Lecture Notes in Computer Science, pages 96-108. Springer, 2018. URL: https://doi.org/10.1007/978-3-319-98654-8_8.
  4. Mikolaj Bojanczyk. Polyregular functions. CoRR, abs/1810.08760, 2018. URL: https://doi.org/10.48550/arXiv.1810.08760.
  5. Mikolaj Bojanczyk. Transducers of polynomial growth. In Christel Baier and Dana Fisman, editors, LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2 - 5, 2022, pages 1:1-1:27. ACM, 2022. URL: https://doi.org/10.1145/3531130.3533326.
  6. Mikolaj Bojanczyk, Laure Daviaud, and Shankara Narayanan Krishna. Regular and first-order list functions. In Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018, Oxford, UK, July 09-12, 2018, pages 125-134, 2018. URL: https://doi.org/10.1145/3209108.3209163.
  7. Mikolaj Bojanczyk, Sandra Kiefer, and Nathan Lhote. String-to-string interpretations with polynomial-size output. In Christel Baier, Ioannis Chatzigiannakis, Paola Flocchini, and Stefano Leonardi, editors, 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, July 9-12, 2019, Patras, Greece, volume 132 of LIPIcs, pages 106:1-106:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. URL: https://doi.org/10.4230/LIPICS.ICALP.2019.106.
  8. Michal P. Chytil and Vojtěch Jákl. Serial composition of 2-way finite-state transducers and simple programs on strings. In Automata, languages and programming (Fourth Colloq., Univ. Turku, Turku, 1977), pages 135-137. Lecture Notes in Comput. Sci., Vol. 52. Springer, Berlin, 1977. Google Scholar
  9. Bruno Courcelle. Monadic second-order definable graph transductions: a survey [see MR1251992 (94f:68009)]. Theoret. Comput. Sci., 126(1):53-75, 1994. Seventeenth Colloquium on Trees in Algebra and Programming (CAAP '92) and European Symposium on Programming (ESOP) (Rennes, 1992). URL: https://doi.org/10.1016/0304-3975(94)90268-2.
  10. Luc Dartois, Paulin Fournier, Ismaël Jecker, and Nathan Lhote. On reversible transducers. In Ioannis Chatzigiannakis, Piotr Indyk, Fabian Kuhn, and Anca Muscholl, editors, 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, Warsaw, Poland, volume 80 of LIPIcs, pages 113:1-113:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. URL: https://doi.org/10.4230/LIPIcs.ICALP.2017.113.
  11. Luc Dartois, Paul Gastin, Loïc Germerie Guizouarn, and Shankaranarayanan Krishna. Reversible pebble transducers. CoRR, 2025. URL: https://doi.org/10.48550/arXiv.2506.11334.
  12. Vrunda Dave, Paul Gastin, and Shankara Narayanan Krishna. Regular Transducer Expressions for Regular Transformations. In Martin Hofmann, Anuj Dawar, and Erich Grädel, editors, Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic In Computer Science (LICS'18), pages 315-324, Oxford, UK, July 2018. ACM Press. URL: https://doi.org/10.1145/3209108.3209182.
  13. Joost Engelfriet. Two-way pebble transducers for partial functions and their composition. Acta Informatica, 52(7-8):559-571, 2015. URL: https://doi.org/10.1007/S00236-015-0224-3.
  14. Joost Engelfriet and Hendrik Jan Hoogeboom. MSO definable string transductions and two-way finite-state transducers. ACM Transactions on Computational Logic, 2(2):216-254, 2001. URL: https://doi.org/10.1145/371316.371512.
  15. Joost Engelfriet and Sebastian Maneth. Two-way finite state transducers with nested pebbles. In Krzysztof Diks and Wojciech Rytter, editors, Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002, Proceedings, volume 2420 of Lecture Notes in Computer Science, pages 234-244. Springer, 2002. URL: https://doi.org/10.1007/3-540-45687-2_19.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact