English

Pebble Minimization of Polyregular Functions

Formal Languages and Automata Theory 2023-02-16 v2

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.

Cite

@article{arxiv.2006.16645,
  title  = {Pebble Minimization of Polyregular Functions},
  author = {Nathan Lhote},
  journal= {arXiv preprint arXiv:2006.16645},
  year   = {2023}
}

Comments

The main result of the article is false. Counterexamples and more can be found here: arXiv:2301.09234

R2 v1 2026-06-23T16:43:45.077Z