Weighted Tree Automata -- May it be a little more?

2022/12/11 by Fülöp, Zoltán, Vogler, Heiko · 2 citations
#FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL)

paper · doi:10.48550/arxiv.2212.05529

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.

Cited by

• Free polynomial strong bimonoids
• Characterization of deterministically recognizable weighted tree languages over commutative semifields by finitely generated and cancellative scalar algebras

Related

• Root-Weighted Tree Automata and their Applications to Tree Kernels
• Weighted Tree Automata with Constraints
• Notes on Equivalence and Minimization of Weighted Automata
• The generating power of weighted tree automata with initial algebra semantics
• Tree Automata and Tree Grammars