What's decidable about weighted automata?
type: Item
instance of: scholarly article
title: What's decidable about weighted automata?
author: Shaull Almagor
author: Udi Boker
author: Orna Kupferman
published in: Information and Computation
publication date: 2022-01-06T00:00:00Z
full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 7452651
MaRDI profile type: Publication
OpenAlex ID: W3099743106
cites work: Weak cost register automata are still powerful
cites work: Max and Sum Semantics for Alternating Weighted Automata
cites work: Reasoning about online algorithms with weighted automata
cites work: Q5146511
cites work: Temporal Specifications with Accumulative Values
cites work: Exact and Approximate Determinization of Discounted-Sum Automata
cites work: The Target Discounted-Sum Problem
cites work: Quantitative Languages
cites work: Alternating Weighted Automata
cites work: Expressiveness and closure properties for quantitative languages
cites work: Energy and Mean-Payoff Games with Imperfect Information
cites work: Weighted automata and weighted logics
cites work: Handbook of weighted automata
cites work: Weighted automata and weighted MSO logics for average and long-time behaviors
cites work: Q4079524
cites work: Semigroups, Presburger formulas, and languages
cites work: Limitedness theorem on finite automata with distance functions
cites work: New upper bounds to the limitedness of distance automata
cites work: DECIDABILITY OF THE EQUIVALENCE PROBLEM FOR FINITELY AMBIGUOUS FINANCE AUTOMATA
cites work: Efficient Algorithms for Shortest Paths in Sparse Networks
cites work: Q3994777
cites work: A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata
cites work: THE EQUALITY PROBLEM FOR RATIONAL SERIES WITH MULTIPLICITIES IN THE TROPICAL SEMIRING IS UNDECIDABLE
cites work: Some consequences of a Fatou property of the tropical semiring
cites work: Q3113725
cites work: The limitedness problem on distance automata: Hashiguchi's method revisited
cites work: Q5590814
cites work: On Context-Free Languages
cites work: Q5643915
cites work: Relationships between nondeterministic and deterministic tape complexities
cites work: On the definition of a family of automata
cites work: Automata, Languages and Programming
cites work: Q3804221
cites work: Factorization forests of finite height
cites work: On semigroups of matrices over the tropical semiring
cites work: Q3392275
cites work: The complexity of mean payoff games on graphs
DOI: 10.1016/J.IC.2020.104651
description: scientific article; zbMATH DE number 7452651