Crisp-determinization of weighted tree automata over additively locally finite and past-finite monotonic strong bimonoids is decidable
From MaRDI portal
Publication:2040408
DOI10.1007/978-3-030-62536-8_4zbMath1496.68207OpenAlexW3101648021MaRDI QIDQ2040408
Heiko Vogler, Dávid Kószó, Zoltán Fülöp, Manfred Droste
Publication date: 14 July 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-62536-8_4
Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items (5)
Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids ⋮ Decidability Boundaries for the Finite-Image Property of Weighted Finite Automata ⋮ Unnamed Item ⋮ Weighted Automata over Vector Spaces ⋮ Determinisability of unary weighted automata over the rational numbers
This page was built for publication: Crisp-determinization of weighted tree automata over additively locally finite and past-finite monotonic strong bimonoids is decidable
