Abstract

We present a determinization construction for weighted tree automata using factorizations. Among others, this result subsumes a previous result for determinization of weighted string automata using factorizations (Kirsten and Mäurer, 2005) and two previous results for weighted tree automata, one of them not using factorizations (Borchardt, 2004) and one of them restricted to nonrecursive automata over the nonnegative reals (May and Knight, 2006).

Date

September 26, 2025

Authors

Matthias Büchse, Jonathan May, Heiko Vogler

Journal

J. Autom. Lang. Comb.

Volume

15

Issue

3/4

Pages

229-254