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

Autor:	Fülöp, Zoltán, Vogler, Heiko
Rok vydání:	2022
Předmět:	Computer Science - Formal Languages and Automata Theory
Druh dokumentu:	Working Paper
Popis:	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.
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2212.05529 Zobrazit plný text záznamu View this record from Arxiv