First-order tree-to-tree functions
Formal Languages and Automata Theory
2023-01-31 v2
Abstract
We study tree-to-tree transformations that can be defined in first-order logic or monadic second-order logic. We prove a decomposition theorem, which shows that every transformation can be obtained from prime transformations, such as tree-to-tree homomorphisms or pre-order traversal, by using combinators such as function composition.
Cite
@article{arxiv.2002.09307,
title = {First-order tree-to-tree functions},
author = {Mikołaj Bojańczyk and Amina Doumane},
journal= {arXiv preprint arXiv:2002.09307},
year = {2023}
}
Comments
This version contains an erratum. Theorem 6.1 in the published version was not valid in its full generality