Weighted Tree Automata -- May it be a little more?
Formal Languages and Automata Theory
2026-01-28 v3
Abstract
This is a book on weighted tree automata. We present the basic definitions and some of the important results in a coherent form with full proofs. The concept of weighted tree automata is part of Automata Theory and it touches the area of Universal Algebra. It originated from two sources: weighted string automata and finite-state tree automata.
Keywords
Cite
@article{arxiv.2212.05529,
title = {Weighted Tree Automata -- May it be a little more?},
author = {Zoltán Fülöp and Heiko Vogler},
journal= {arXiv preprint arXiv:2212.05529},
year = {2026}
}