ABSTRACT
The polyregular functions are a class of string-to-string functions that have polynomial size outputs, and which can be defined using finite state models. There are many equivalent definitions of this class, with roots in automata theory, programming languages and logic. This paper surveys recent results on polyregular functions. It presents five of the equivalent definitions, and gives self-contained proofs for most of the equivalences. Decision problems as well as restricted subclasses of the polyregular functions are also discussed.
- Rajeev Alur and Pavol Černý. 2010. Expressiveness of Streaming String Transducers. In Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, Chennai, India(LIPIcs, Vol. 8). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 1–12.Google Scholar
- Rajeev Alur, Adam Freilich, and Mukund Raghothaman. 2014. Regular combinators for string transformations. In Computer Science Logic and Logic in Computer Science, CSL-LICS 2014, Vienna, Austria,. ACM, 1–10.Google ScholarDigital Library
- Félix Baschenis, Olivier Gauwin, Anca Muscholl, and Gabriele Puppis. 2016. Minimizing resources of sweeping and streaming string transducers. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), Vol. 55. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 114–1.Google Scholar
- Félix Baschenis, Olivier Gauwin, Anca Muscholl, and Gabriele Puppis. 2017. Untwisting two-way transducers in elementary time. In 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). 1–12.Google ScholarCross Ref
- Mikołaj Bojańczyk. 2018. Polyregular Functions. CoRR abs/1810.08760(2018).Google Scholar
- Mikołaj Bojańczyk. 2022. The growth rate of polyregular functions (unpublished). (May 2022).Google Scholar
- Mikołaj Bojańczyk and Wojciech Czerwiński. [n.d.]. An Automata Toolbox.Google Scholar
- Mikołaj Bojańczyk, Laure Daviaud, and Shankara Narayanan Krishna. 2018. Regular and First-Order List Functions. In Logic in Computer Science, LICS, Oxford, UK. ACM, 125–134.Google Scholar
- Mikolaj Bojanczyk, Sandra Kiefer, and Nathan Lhote. 2019. String-to-String Interpretations With Polynomial-Size Output. In 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, July 9-12, 2019, Patras, Greece. 106:1–106:14.Google Scholar
- Arthur W Burks and Hao Wang. 1957. The Logic of Automata—Part I. Journal of the ACM (JACM) 4, 2 (1957), 193–218.Google ScholarDigital Library
- Michal Chytil and Vojtech Jákl. 1977. Serial Composition of 2-Way Finite-State Transducers and Simple Programs on Strings. In International Colloquium on Automata, Languages and Programming, ICALP, Turku, Finland(Lecture Notes in Computer Science, Vol. 52). Springer, 135–147.Google Scholar
- Thomas Colcombet. 2007. A Combinatorial Theorem for Trees. In International Colloquium on Automata, Languages and Programming, ICALP, Wrocław, Poland(Lecture Notes in Computer Science). Springer, 901–912.Google Scholar
- Bruno Courcelle and Joost Engelfriet. 2012. Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach. Encyclopedia of Mathematics and Its Applications, Vol. 138. Cambridge University Press.Google Scholar
- Gaëtan Douéneau-Tabot. 2021. Pebble Transducers with Unary Output. In 46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021, August 23-27, 2021, Tallinn, Estonia(LIPIcs, Vol. 202), Filippo Bonchi and Simon J. Puglisi (Eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 40:1–40:17.Google Scholar
- Gaëtan Douéneau-Tabot, Emmanuel Filiot, and Paul Gastin. 2020. Register Transducers Are Marble Transducers. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)(Leibniz International Proceedings in Informatics (LIPIcs), Vol. 170), Javier Esparza and Daniel Kráľ (Eds.). Schloss Dagstuhl–Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 29:1–29:14.Google Scholar
- Joost Engelfriet. 2015. Two-way pebble transducers for partial functions and their composition. Acta Inf. 52, 7-8 (2015), 559–571.Google ScholarDigital Library
- Joost Engelfriet and Hendrik Jan Hoogeboom. 2001. MSO Definable String Transductions and Two-Way Finite-State Transducers. ACM Trans. Comput. Logic 2, 2 (2001), 216–254.Google ScholarDigital Library
- Joost Engelfriet, Hendrik Jan Hoogeboom, and Bart Samwel. 2007. XML transformation by tree-walking transducers with invisible pebbles. In Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems. 63–72.Google ScholarDigital Library
- Joost Engelfriet, Kazuhiro Inaba, and Sebastian Maneth. 2021. Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity. Acta Informatica 58, 1-2 (2021), 95–152.Google ScholarCross Ref
- Joost Engelfriet and Sebastian Maneth. 2002. Two-way finite state transducers with nested pebbles. In International Symposium on Mathematical Foundations of Computer Science. Springer, 234–244.Google ScholarCross Ref
- Noa Globerman and David Harel. 1996. Complexity Results for Two-Way and Multi-Pebble Automata and their Logics. Theor. Comput. Sci. 169, 2 (1996), 161–184.Google ScholarDigital Library
- Wilfrid Hodges. 1993. Model Theory. Cambridge University Press.Google Scholar
- J. E. Hopcroft and J. D. Ullman. 1967. An approach to a unified theory of automata. In 8th Annual Symposium on Switching and Automata Theory (SWAT 1967). 140–147.Google ScholarDigital Library
- Oscar H Ibarra. 1971. Characterizations of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata. J. Comput. System Sci. 5, 2 (1971), 88–117.Google ScholarDigital Library
- Kenneth Krohn and John Rhodes. 1965. Algebraic theory of machines. I. Prime decomposition theorem for finite semigroups and machines. Trans. Amer. Math. Soc. 116 (1965), 450–450.Google ScholarCross Ref
- Nathan Lhote. 2020. Pebble Minimization of Polyregular Functions. In LICS ’20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020. 703–712.Google ScholarDigital Library
- Albert R. Meyer. 1975. Weak monadic second order theory of succesor is not elementary-recursive. In Logic Colloquium (Boston, Mass., 1972–1973). Springer, Berlin, 132–154. Lecture Notes in Math., Vol. 453.Google Scholar
- Tova Milo, Dan Suciu, and Victor Vianu. 2003. Typechecking for XML transformers. J. Comput. Syst. Sci. 66, 1 (2003), 66–97.Google ScholarDigital Library
- Lê Thành Dung Nguyên, Camille Noûs, and Pierre Pradic. [n.d.]. Comparison-Free Polyregular Functions (Hal version 1).Google Scholar
- Lê Thành Dung Nguyên, Camille Noûs, and Pierre Pradic. 2021. Comparison-Free Polyregular Functions. In 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference). 139:1–139:20.Google Scholar
- Michael O. Rabin and Dana Scott. 1959. Finite automata and their decision problems. IBM J. Res. Develop. 3(1959), 114–125.Google ScholarDigital Library
- Marcel Paul Schützenberger. 1961. On the definition of a family of automata. Information and control 4, 2–3 (1961), 245–270.Google Scholar
- Dana Scott. 1967. Some definitional suggestions for automata theory. J. Comput. System Sci. 1, 2 (1967), 187–212.Google ScholarDigital Library
- J. C. Shepherdson. 1959. The Reduction of Two-Way Automata to One-Way Automata. IBM Journal of Research and Development 3, 2 (April 1959), 198–200.Google ScholarDigital Library
- Wolfgang Thomas. 1997. Languages, automata, and logic. In Handbook of formal languages, Vol. 3. Springer, Berlin, 389–455.Google ScholarDigital Library
- Boris Avraamovich Trakhtenbrot. 1957. On operators realizable in logical nets. In Doklady Akademii Nauk, Vol. 112. Russian Academy of Sciences, 1005–1007.Google Scholar
Recommendations
Visibly Pushdown Automata and Transducers with Counters
Non-Classical Models of Automata and Applications VIWe generalize the models of visibly pushdown automata (VPDAs) and visibly pushdown transducers (VPDTs) by equipping them with reversal-bounded counters. We show that some of the results for VPDAs and VPDTs (e.g., closure under intersection and ...
Visibly pushdown transducers with look-ahead
SOFSEM'12: Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer ScienceVisibly Pushdown Transducers (VPT) form a subclass of pushdown transducers. In this paper, we investigate the extension of VPT with visibly pushdown look-ahead (VPTla ). Their transitions are guarded by visibly pushdown automata that can check whether ...
Copyful Streaming String Transducers
Special Issue on the 11th International Workshop on Reachability Problems (RP 2017)Copyless streaming string transducers (copyless SST) have been introduced by R. Alur and P. Černý in 2010 as a one-way deterministic automata model to define transductions of finite strings. Copyless SST extend deterministic finite state automata with a ...
Comments