Rational functions via recursive schemes

02/06/2023
by   Siddharth Bhaskar, et al.
0

We give a new characterization of the class of rational string functions from formal language theory using order-preserving interpretations with respect to a very weak monadic programming language. This refines the known characterization of rational functions by order-preserving MSO interpretations.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/15/2021

Tangent-Chebyshev rational maps and Redei functions

Recently Lima and Campello de Souza introduced a new class of rational f...
research
10/22/2019

Bicubic partially blended rational quartic surface

This paper investigates some univariate and bivariate constrained interp...
research
06/26/2019

Approximating the pth Root by Composite Rational Functions

A landmark result from rational approximation theory states that x^1/p o...
research
05/30/2019

String-to-String Interpretations with Polynomial-Size Output

String-to-string MSO interpretations are like Courcelle's MSO transducti...
research
01/23/2023

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

Polyregular functions are the class of string-to-string functions defina...
research
12/21/2019

Logic and Rational Languages of Scattered and Countable Series-Parallel Posets

Let A be an alphabet and SP^(A) denote the class of all countable N-free...
research
01/12/2023

Folding interpretations

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

Please sign up or login with your details

Forgot password? Click here to reset