Disambiguation of weighted tree automata

DOI10.1007/978-3-030-93489-7_14MaRDI QIDQ2096595zbMATH OpenOpenAlexFDO

Authors Kevin Stier, Markus Ulbricht

Publication date 9 November 2022

Full work available at URL https://doi.org/10.1007/978-3-030-93489-7_14

zbMATH Keywords

tree automataweighted automataunambiguous automatatwins property

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• On the disambiguation of weighted automata
• A disambiguation algorithm for weighted automata
• Ambiguity hierarchies for weighted tree automata
• Ambiguity Hierarchies for Weighted Tree Automata
• Weighted tree automata and tree transducers
• On finite and polynomial ambiguity of weighted tree automata
• Weighted tree automata and weighted logics
• Approximated determinisation of weighted tree automata
• Weighted Languages Recognizable by Weighted Tree Automata
• A Kleene theorem for weighted tree automata

Cites work

• scientific article; zbMATH DE number 5141500 (Why is no real title available?)
• scientific article; zbMATH DE number 4072419 (Why is no real title available?)
• scientific article; zbMATH DE number 41838 (Why is no real title available?)
• scientific article; zbMATH DE number 3588051 (Why is no real title available?)
• scientific article; zbMATH DE number 1257742 (Why is no real title available?)
• scientific article; zbMATH DE number 2143011 (Why is no real title available?)
• scientific article; zbMATH DE number 1358710 (Why is no real title available?)
• scientific article; zbMATH DE number 7354705 (Why is no real title available?)
• scientific article; zbMATH DE number 2211801 (Why is no real title available?)
• A disambiguation algorithm for weighted automata
• Approximated determinisation of weighted tree automata
• Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
• Determinization of transducers over finite and infinite words.
• Determinization of weighted tree automata using factorizations
• Handbook of weighted automata
• Rigorous approximated determinization of weighted automata
• THE EQUALITY PROBLEM FOR RATIONAL SERIES WITH MULTIPLICITIES IN THE TROPICAL SEMIRING IS UNDECIDABLE
• Une caractérisation des fonctions séquentielles et des fonctions sous- séquentielles en tant que rélations rationnelles

Cited in

(2)

• Solving the Weighted HOM-Problem With the Help of Unambiguity
• DECOMPOSITION OF WEIGHTED MULTIOPERATOR TREE AUTOMATA

This page was built for publication: Disambiguation of weighted tree automata

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