Document Open Access Logo

Algebraic Recognition of Regular Functions

Authors Mikołaj Bojańczyk, Lê Thành Dũng (Tito) Nguyễn

PDF
Thumbnail PDF

File

LIPIcs.ICALP.2023.117.pdf
  • Filesize: 0.93 MB
  • 19 pages

Document Identifiers

Author Details

Mikołaj Bojańczyk
  • Institute of Informatics, University of Warsaw, Poland
Lê Thành Dũng (Tito) Nguyễn
  • Laboratoire de l'informatique du parallélisme (LIP), École normale supérieure de Lyon, France

Funding

  • Nguyễn, Lê Thành Dũng (Tito): Supported by the LABEX MILYON (ANR-10-LABX-0070) of Université de Lyon, within the program "Investissements d'Avenir" (ANR-11-IDEX-0007) operated by the French National Research Agency (ANR).

Acknowledgements

We thank the reviewers for helpful suggestions on the presentation of the paper.

Cite As Get BibTex

Mikołaj Bojańczyk and Lê Thành Dũng (Tito) Nguyễn. Algebraic Recognition of Regular Functions. In 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 261, pp. 117:1-117:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023) https://doi.org/10.4230/LIPIcs.ICALP.2023.117

Abstract

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.

Subject Classification

ACM Subject Classification
  • Theory of computation → Transducers
Keywords
  • string transducers
  • semigroups
  • category theory

Metrics

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

Related Versions

References

  1. Rajeev Alur and Pavol Černý. Expressiveness of streaming string transducers. In Kamal Lodaya and Meena Mahajan, editors, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, volume 8 of LIPIcs, pages 1-12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. URL: https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1.
  2. Rajeev Alur, Taylor Dohmen, and Ashutosh Trivedi. Composing copyless streaming string transducers, 2022. URL: https://arxiv.org/abs/2209.05448.
  3. Rajeev Alur, Emmanuel Filiot, and Ashutosh Trivedi. Regular transformations of infinite strings. In Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, LICS 2012, Dubrovnik, Croatia, June 25-28, 2012, pages 65-74. IEEE Computer Society, 2012. URL: https://doi.org/10.1109/LICS.2012.18.
  4. Rajeev Alur, Adam Freilich, and Mukund Raghothaman. Regular combinators for string transformations. In Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) - CSL-LICS '14, pages 1-10, Vienna, Austria, 2014. ACM Press. URL: https://doi.org/10.1145/2603088.2603151.
  5. Mikołaj Bojańczyk. Transducers with origin information. In Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, and Elias Koutsoupias, editors, Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II, volume 8573 of Lecture Notes in Computer Science, pages 26-37. Springer, 2014. URL: https://doi.org/10.1007/978-3-662-43951-7_3.
  6. Mikołaj Bojańczyk. Languages recognised by finite semigroups, and their generalisations to objects such as trees and graphs, with an emphasis on definability in monadic second-order logic, 2020. URL: https://arxiv.org/abs/2008.11635.
  7. Mikołaj Bojańczyk. 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.
  8. Mikołaj Bojańczyk, 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 '18, pages 125-134, Oxford, United Kingdom, 2018. ACM Press. URL: https://doi.org/10.1145/3209108.3209163.
  9. Mikołaj Bojańczyk and Amina Doumane. First-order tree-to-tree functions, 2020. Corrected version with erratum of a LICS 2020 paper. URL: https://arxiv.org/abs/2002.09307v2.
  10. Mikołaj Bojańczyk and Rafał Stefański. Single-use automata and transducers for infinite alphabets. In Artur Czumaj, Anuj Dawar, and Emanuela Merelli, editors, 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference), volume 168 of LIPIcs, pages 113:1-113:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. URL: https://doi.org/10.4230/LIPIcs.ICALP.2020.113.
  11. Michal Chytil and Vojtech Jákl. Serial composition of 2-way finite-state transducers and simple programs on strings. In Arto Salomaa and Magnus Steinby, editors, Automata, Languages and Programming, Fourth Colloquium, University of Turku, Finland, July 18-22, 1977, Proceedings, volume 52 of Lecture Notes in Computer Science, pages 135-147. Springer, 1977. URL: https://doi.org/10.1007/3-540-08342-1_11.
  12. Thomas Colcombet and Daniela Petrişan. Automata Minimization: a Functorial Approach. Logical Methods in Computer Science, 16(1), March 2020. URL: https://doi.org/10.23638/LMCS-16(1:32)2020.
  13. 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, April 2001. URL: https://doi.org/10.1145/371316.371512.
  14. Joost Engelfriet and Sebastian Maneth. Macro Tree Transducers, Attribute Grammars, and MSO Definable Tree Translations. Information and Computation, 154(1):34-91, October 1999. URL: https://doi.org/10.1006/inco.1999.2807.
  15. Paul Gallot, Aurélien Lemay, and Sylvain Salvati. Linear high-order deterministic tree transducers with regular look-ahead. In Javier Esparza and Daniel Král', editors, 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, August 24-28, 2020, Prague, Czech Republic, volume 170 of LIPIcs, pages 38:1-38:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. URL: https://doi.org/10.4230/LIPIcs.MFCS.2020.38.
  16. Claudio Hermida, Uday S. Reddy, and Edmund P. Robinson. Logical Relations and Parametricity - A Reynolds Programme for Category Theory and Programming Languages. In John Power and Cai Wingfield, editors, Proceedings of the Workshop on Algebra, Coalgebra and Topology, WACT 2013, Bath, UK, March 1, 2013, volume 303 of Electronic Notes in Theoretical Computer Science, pages 149-180. Elsevier, 2013. URL: https://doi.org/10.1016/j.entcs.2014.02.008.
  17. Anca Muscholl and Gabriele Puppis. The Many Facets of String Transducers. In Rolf Niedermeier and Christophe Paul, editors, 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019), volume 126 of Leibniz International Proceedings in Informatics (LIPIcs), pages 2:1-2:21. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2019. URL: https://doi.org/10.4230/LIPIcs.STACS.2019.2.
  18. Lê Thành Dũng Nguy~ên. Implicit automata in linear logic and categorical transducer theory. PhD thesis, Université Paris XIII (Sorbonne Paris Nord), December 2021. URL: https://theses.hal.science/tel-04132636.
  19. Lê Thành Dũng Nguy~ên and Cécilia Pradic. Implicit automata in typed λ-calculi I: aperiodicity in a non-commutative logic. In Artur Czumaj, Anuj Dawar, and Emanuela Merelli, editors, 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference), volume 168 of LIPIcs, pages 135:1-135:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. URL: https://doi.org/10.4230/LIPIcs.ICALP.2020.135.
  20. John Rhodes and Bret Tilson. The kernel of monoid morphisms. Journal of Pure and Applied Algebra, 62(3):227-268, 1989. URL: https://doi.org/10.1016/0022-4049(89)90137-0.
  21. Jacques Sakarovitch. Elements of Automata Theory. Cambridge University Press, 2009. Translated by Reuben Thomas. URL: https://doi.org/10.1017/CBO9781139195218.
  22. John C. Shepherdson. The reduction of two-way automata to one-way automata. IBM Journal of Research and Development, 3(2):198-200, April 1959. URL: https://doi.org/10.1147/rd.32.0198.
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-2024 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact