What’s Decidable about Weighted Automata?

DOI10.1007/978-3-642-24372-1_37zbMath1348.68089OpenAlexW1835836356MaRDI QIDQ3172937

Udi Boker, Shaull Almagor, Orna Kupferman

Publication date: 7 October 2011

Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-24372-1_37

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (37)

Coalgebras for Bisimulation of Weighted Automata over Semirings ⋮ Integer weighted automata on infinite words ⋮ Looking at mean payoff through foggy windows ⋮ Unnamed Item ⋮ Multi-Valued Reasoning about Reactive Systems ⋮ Weighted Automata on Infinite Words in the Context of Attacker-Defender Games ⋮ When are emptiness and containment decidable for probabilistic automata? ⋮ Rigorous approximated determinization of weighted automata ⋮ Parameterized Weighted Containment ⋮ Unnamed Item ⋮ Integer Weighted Automata on Infinite Words ⋮ Quantitative vs. weighted automata ⋮ Isomorphisms of scattered automatic linear orders ⋮ Unnamed Item ⋮ Up-To Techniques for Weighted Systems ⋮ Copyless cost-register automata: structure, expressiveness, and closure properties ⋮ Non-deterministic Weighted Automata on Random Words ⋮ Compositional Branching-Time Measurements ⋮ Non-deterministic weighted automata evaluated over Markov chains ⋮ Weighted automata on infinite words in the context of attacker-defender games ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Decidable weighted expressions with Presburger combinators ⋮ CTL\(^\ast\) with graded path modalities ⋮ Best-by-simulations: a framework for comparing efficiency of reconfigurable architectures on workloads with deadlines ⋮ Freeness properties of weighted and probabilistic automata over bounded languages ⋮ Unnamed Item ⋮ Streamable regular transductions ⋮ A generalized partition refinement algorithm, instantiated to language equivalence checking for weighted automata ⋮ Unnamed Item ⋮ Weighted automata ⋮ Comparison of max-plus automata and joint spectral radius of tropical matrices ⋮ Unambiguity in Automata Theory ⋮ Unnamed Item ⋮ Image-binary automata ⋮ Weak Cost Register Automata are Still Powerful

This page was built for publication: What’s Decidable about Weighted Automata?