DeepAI AI Chat
Log In Sign Up

On the growth rate of polyregular functions

by   Mikołaj Bojańczyk, et al.

We consider polyregular functions, which are certain string-to-string functions that have polynomial output size. We prove that a polyregular function has output size 𝒪(n^k) if and only if it can be defined by an MSO interpretation of dimension k, i.e. a string-to-string transformation where every output position is interpreted, using monadic second-order logic MSO, in some k-tuple of input positions. We also show that this characterization does not extend to pebble transducers, another model for describing polyregular functions: we show that for every k ∈{1,2,…} there is a polyregular function of quadratic output size which needs at least k pebbles to be computed.


page 1

page 2

page 3

page 4


String-to-String Interpretations with Polynomial-Size Output

String-to-string MSO interpretations are like Courcelle's MSO transducti...

Learning with Partially Ordered Representations

This paper examines the characterization and learning of grammars define...

Growth Functions, Rates and Classes of String-Based Multiway Systems

In context of the Wolfram Physics Project, a certain class of abstract r...

Revisiting the growth of polyregular functions: output languages, weighted automata and unary inputs

Polyregular functions are the class of string-to-string functions defina...

Folding interpretations

We study the polyregular string-to-string functions, which are certain f...

When a Dollar Makes a BWT

The Burrows-Wheeler-Transform (BWT) is a reversible string transformatio...

Characterizing 4-string contact interaction using machine learning

The geometry of 4-string contact interaction of closed string field theo...