Ambiguity hierarchies for weighted tree automata

DOI10.1007/978-3-030-79121-6_12OpenAlexW3176710411MaRDI QIDQ2117674

Teodora Nasz, Markus Ulbricht, Kevin Stier, Andreas Maletti

Publication date: 22 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-79121-6_12

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

An ambiguity hierarchy of weighted context-free grammars ⋮ Polynomially ambiguous unary weighted automata over fields ⋮ Ambiguity Hierarchies for Weighted Tree Automata ⋮ An ambiguity hierarchy of weighted context-free grammars ⋮ Finite ambiguity and finite sequentiality in weighted automata over fields

Cites Work

• 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
• Finite sequentiality of unambiguous max-plus 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