Disambiguation of weighted tree automata

DOI10.1007/978-3-030-93489-7_14OpenAlexW4205871688MaRDI QIDQ2096595

Markus Ulbricht, Kevin Stier

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)

Related Items

Solving the Weighted HOM-Problem With the Help of Unambiguity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rigorous approximated determinization of weighted automata
• Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
• Handbook of weighted automata
• Une caractérisation des fonctions séquentielles et des fonctions sous- séquentielles en tant que rélations rationnelles
• Determinization of transducers over finite and infinite words.
• Approximated determinisation of weighted tree automata
• A disambiguation algorithm for weighted automata
• THE EQUALITY PROBLEM FOR RATIONAL SERIES WITH MULTIPLICITIES IN THE TROPICAL SEMIRING IS UNDECIDABLE