What's decidable about weighted automata?
From MaRDI portal
Publication:2064522
DOI10.1016/j.ic.2020.104651OpenAlexW3099743106MaRDI QIDQ2064522
Orna Kupferman, Udi Boker, Shaull Almagor
Publication date: 6 January 2022
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.228.3783
Related Items (7)
Decidability Boundaries for the Finite-Image Property of Weighted Finite Automata ⋮ On the comparison of discounted-sum automata with multiple discount factors ⋮ Bideterministic weighted automata ⋮ Bideterministic weighted automata ⋮ Unnamed Item ⋮ On some decidability questions concerning supports of rational series ⋮ On eventual non-negativity and positivity for the weighted sum of powers of matrices
Cites Work
- Handbook of weighted automata
- Factorization forests of finite height
- Limitedness theorem on finite automata with distance functions
- Some consequences of a Fatou property of the tropical semiring
- The complexity of mean payoff games on graphs
- New upper bounds to the limitedness of distance automata
- Weak cost register automata are still powerful
- The limitedness problem on distance automata: Hashiguchi's method revisited
- Weighted automata and weighted MSO logics for average and long-time behaviors
- Weighted automata and weighted logics
- Semigroups, Presburger formulas, and languages
- Relationships between nondeterministic and deterministic tape complexities
- Expressiveness and Closure Properties for Quantitative Languages
- Temporal Specifications with Accumulative Values
- Max and Sum Semantics for Alternating Weighted Automata
- Alternating Weighted 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
- Quantitative Languages
- Energy and Mean-Payoff Games with Imperfect Information
- Efficient Algorithms for Shortest Paths in Sparse Networks
- THE EQUALITY PROBLEM FOR RATIONAL SERIES WITH MULTIPLICITIES IN THE TROPICAL SEMIRING IS UNDECIDABLE
- On semigroups of matrices over the tropical semiring
- The Target Discounted-Sum Problem
- DECIDABILITY OF THE EQUIVALENCE PROBLEM FOR FINITELY AMBIGUOUS FINANCE AUTOMATA
- Exact and Approximate Determinization of Discounted-Sum Automata
- Automata, Languages and Programming
- On Context-Free Languages
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: What's decidable about weighted automata?
