Ambiguity Hierarchies for Weighted Tree Automata

DOI10.1142/s0129054123430013OpenAlexW4323049031MaRDI QIDQ6070750

Markus Ulbricht, Kevin Stier, Andreas Maletti, Teodora Nasz

Publication date: 24 November 2023

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054123430013

zbMATH Keywords

ambiguitypumping lemmaweighted automatatropical semiringweighted tree automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
• The rank of a formal tree power series
• Handbook of weighted automata
• Recognizable formal power series on trees
• Idempotents, regular elements and sequences from finite semigroups
• Ambiguity hierarchies for weighted tree automata
• Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
• Tree acceptors and some of their applications
• On Finite and Polynomial Ambiguity of Weighted Tree Automata
• THE CATEGORY OF SIMULATIONS FOR WEIGHTED TREE AUTOMATA
• Bisimulation Minimisation of Weighted Automata on Unranked Trees
• THE EQUALITY PROBLEM FOR RATIONAL SERIES WITH MULTIPLICITIES IN THE TROPICAL SEMIRING IS UNDECIDABLE
• Rational and Recognisable Power Series
• Weighted Tree Automata and Tree Transducers
• Implementation and Application of Automata

This page was built for publication: Ambiguity Hierarchies for Weighted Tree Automata