Pebble Minimization of Polyregular Functions
Nathan Lhote
Abstract
We show that a polyregular word-to-word function is regular if and only if its output size is at most linear in its input size. Moreover a polyregular function can be realized by: a transducer with two pebbles if and only if its output has quadratic size in its input, a transducer with three pebbles if and only if its output has cubic size in its input, etc.
Moreover the characterization is decidable and, given a polyregular function, one can compute a transducer realizing it with the minimal number of pebbles.
We apply the result to mso interpretations from words to words. We show that mso interpretations of dimension k exactly coincide with k-pebble transductions.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 7c1e1705-3d8a-44a5-bf68-01b60550a976Cited by top-tier papers1
Ask how each one uses itBuilds on1
Related papers
- Folding interpretationsMikolaj BojanczykLICS 2023 · 2 citations
- Uniformisations of Regular Relations Over Bi-Infinite WordsGrzegorz Fabianski, Michal Skrzypczak, Szymon TorunczykLICS 2020 · 1 citation
- Polyregular Model CheckingAliaume Lopez, Rafal StefanskiCAV 2025
- Recognisability Equals Definability for Finitely Representable Matroids of Bounded Path-WidthRutger Campbell, Bruno Guillon, Mamadou Moustapha Kanté, Eun Jung Kim et al.LICS 2025 · 4 citations
- Regular Grammars for Sets of Graphs of Tree-Width 2Marius Bozga, Radu Iosif, Florian ZulegerLICS 2025
