What’s Decidable about Weighted Automata?

DOI10.1007/978-3-642-24372-1_37zbMATH Open1348.68089OpenAlexW1835836356MaRDI QIDQ3172937FDOQ3172937

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)

Cited In (39)

• Title not available (Why is that?)
• Coalgebras for Bisimulation of Weighted Automata over Semirings
• Title not available (Why is that?)
• Integer weighted automata on infinite words
• Integer Weighted Automata on Infinite Words
• Compositional Branching-Time Measurements
• Copyless cost-register automata: structure, expressiveness, and closure properties
• Comparison of max-plus automata and joint spectral radius of tropical matrices
• CTL\(^\ast\) with graded path modalities
• Title not available (Why is that?)
• Weak Cost Register Automata are Still Powerful
• Title not available (Why is that?)
• Non-deterministic weighted automata evaluated over Markov chains
• Title not available (Why is that?)
• Looking at mean payoff through foggy windows
• What's decidable about recursive hybrid automata?
• Title not available (Why is that?)
• Weighted automata on infinite words in the context of attacker-defender games
• Image-binary automata
• Parameterized Weighted Containment
• On polynomial recursive sequences
• Unambiguity in Automata Theory
• 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
• Title not available (Why is that?)
• Isomorphisms of scattered automatic linear orders
• Streamable regular transductions
• Title not available (Why is that?)
• A generalized partition refinement algorithm, instantiated to language equivalence checking for weighted automata
• When are emptiness and containment decidable for probabilistic automata?
• Weighted automata
• Decidable weighted expressions with Presburger combinators
• Quantitative vs. weighted automata
• Title not available (Why is that?)
• Multi-Valued Reasoning about Reactive Systems
• Weighted Automata on Infinite Words in the Context of Attacker-Defender Games
• Rigorous approximated determinization of weighted automata
• Up-To Techniques for Weighted Systems
• Non-deterministic Weighted Automata on Random Words

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3172937)