Finite ambiguity and finite sequentiality in weighted automata over fields

DOI10.1007/978-3-031-09574-0_13OpenAlexW4285270201MaRDI QIDQ2097226

Peter Kostolányi

Publication date: 11 November 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-09574-0_13

zbMATH Keywords

hierarchyrational seriesweighted automatondegree of ambiguitydegree of sequentiality

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• 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
• Handbook of weighted automata
• On the degree of ambiguity of finite automata
• Alternating weighted automata over commutative semirings
• Copyless cost-register automata: structure, expressiveness, and closure properties
• Finite sequentiality of unambiguous max-plus tree automata
• Determinisability of unary weighted automata over the rational numbers
• Probabilistic automata of bounded ambiguity
• Weighted automata
• Ambiguity hierarchies for weighted tree automata
• Polynomially ambiguous probabilistic automata on restricted languages
• Sequential?
• On Finite and Polynomial Ambiguity of Weighted Tree Automata
• Which Finitely Ambiguous Automata Recognize Finitely Sequential Functions?
• Degree of Sequentiality of Weighted Automata
• On the definition of a family of automata
• The Generalized Vandermonde Matrix
• A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata
• Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata
• FINITELY SUBSEQUENTIAL TRANSDUCERS
• Automata, Languages and Programming

This page was built for publication: Finite ambiguity and finite sequentiality in weighted automata over fields