Work

Weighted Alternating Tree Automata

Year: 2026

Type: article

Abstract: We define weighted alternating tree automata -a generalization of weighted (non-alternating) tree automata, (unweighted) alternating tree automata, and weighted alternating (string) automata -over commutative semirings.We study their expressive power, and show that it is equivalent to that of weighted tree automata exactly when the employed semiring is locally finite.In our main result, we characterize the class of weighted tree languages defined by weighted alternating tree automata as the closure of the recognizable weighted tree languages under inverse tree homomorphisms.

Source: Electronic Proceedings in Theoretical Computer Science

DOI: 10.4204/eptcs.451.20

Author: Olle Torstensson

Institution: Linköping University

Language: English

Topic: semigroups and automata theory

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

Funder: Knut och Alice Wallenbergs Stiftelse

OpenAlex ID: W7204121964