Rational functions via recursive schemes
Logic in Computer Science
2023-02-08 v1 Formal Languages and Automata Theory
Abstract
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.
Cite
@article{arxiv.2302.03074,
title = {Rational functions via recursive schemes},
author = {Siddharth Bhaskar and Jane Chandlee and Adam Jardine},
journal= {arXiv preprint arXiv:2302.03074},
year = {2023}
}