Determinization of weighted tree automata using factorizations

DOI10.25596/JALC-2010-229MaRDI QIDQ2819390zbMATH OpenFDO

Authors Matthias Büchse, Jonathan May, Heiko Vogler

Publication date 29 September 2016

Published in Journal of Automata, Languages and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.25596/JALC-2010-229

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited in

(11)

• Conditions for the existence of maximal factorizations
• Finite sequentiality of unambiguous max-plus tree automata
• Disambiguation of weighted tree automata
• Approximated determinisation of weighted tree automata
• Sequentiality of group-weighted tree automata
• Crisp-determinization of weighted tree automata over strong bimonoids
• scientific article; zbMATH DE number 7559164 (Why is no real title available?)
• scientific article; zbMATH DE number 7204387 (Why is no real title available?)
• Finite sequentiality of finitely ambiguous max-plus tree automata
• Finite sequentiality of finitely ambiguous max-plus tree automata
• Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring

This page was built for publication: Determinization of weighted tree automata using factorizations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2819390)