On Finite and Polynomial Ambiguity of Weighted Tree Automata

DOI10.1007/978-3-662-53132-7_30zbMath1436.68186OpenAlexW2491877691MaRDI QIDQ2817402

Erik Paul

Publication date: 30 August 2016

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-53132-7_30

zbMATH Keywords

weighted logicsweighted tree automatafinite ambiguitypolynomial ambiguityquantitative tree automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Related Items (7)

Polynomially ambiguous unary weighted automata over fields ⋮ Ambiguity Hierarchies for Weighted Tree Automata ⋮ Equivalence, Unambiguity, and Sequentiality of Finitely Ambiguous Max-Plus Tree Automata ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Finite ambiguity and finite sequentiality in weighted automata over fields ⋮ Ambiguity hierarchies for weighted tree automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
• Handbook of weighted automata
• Weighted tree automata and weighted logics
• Effective construction of the syntactic algebra of a recognizable series on trees
• Recognizable formal power series on trees
• On the degree of ambiguity of finite automata
• On the finite degree of ambiguity of finite tree automata
• Weighted automata and weighted logics
• Tree acceptors and some of their applications
• Weak Second‐Order Arithmetic and Finite Automata
• On the definition of a family of automata
• A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata
• General Algorithms for Testing the Ambiguity of Finite Automata
• Decision Problems of Finite Automata Design and Related Arithmetics
• THE EQUALITY PROBLEM FOR RATIONAL SERIES WITH MULTIPLICITIES IN THE TROPICAL SEMIRING IS UNDECIDABLE
• DECIDABILITY OF THE EQUIVALENCE PROBLEM FOR FINITELY AMBIGUOUS FINANCE AUTOMATA
• Quantitative Monadic Second-Order Logic
• RELATING TREE SERIES TRANSDUCERS AND WEIGHTED TREE AUTOMATA
• Generalized finite automata theory with an application to a decision problem of second-order logic

This page was built for publication: On Finite and Polynomial Ambiguity of Weighted Tree Automata