What's decidable about weighted automata?

DOI10.1007/978-3-642-24372-1_37MaRDI QIDQ3172937zbMATH OpenOpenAlexFDO

Authors Shaull Almagor, Udi Boker, 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)

Recommendations

• Alternating Weighted Automata
• Probabilistic Weighted Automata
• Quantitative Languages
• Quantitative languages
• Integer weighted automata on infinite words

Cited in

(51)

• Pumping lemmas for weighted automata
• Image-binary automata
• Comparison of max-plus automata and joint spectral radius of tropical matrices
• Up-To Techniques for Weighted Systems
• Finite-valued weighted automata
• Querying best paths in graph databases
• The big-O problem for labelled Markov chains and weighted automata
• Non-deterministic Weighted Automata on Random Words
• scientific article; zbMATH DE number 7577577 (Why is no real title available?)
• Coalgebras for Bisimulation of Weighted Automata over Semirings
• Parameterized weighted containment
• Integer weighted automata on infinite words
• CTL\(^\ast\) with graded path modalities
• How to Tackle Integer Weighted Automata Positivity
• Looking at mean payoff through foggy windows
• The validity of weighted automata
• Streamable regular transductions
• Containment and equivalence of weighted automata: probabilistic and max-plus cases
• Determinisability of unary weighted automata over the rational numbers
• Where automatic structures benefit from weighted automata
• Freeness properties of weighted and probabilistic automata over bounded languages
• On polynomial recursive sequences
• On computability and some decision problems of parametric weighted finite automata
• Isomorphisms of scattered automatic linear orders
• Polynomial automata: zeroness and applications
• The big-O problem
• Weak cost register automata are still powerful
• Weighted automata on infinite words in the context of attacker-defender games
• Compositional branching-time measurements
• Rigorous approximated determinization of weighted automata
• scientific article; zbMATH DE number 7471710 (Why is no real title available?)
• scientific article; zbMATH DE number 7559473 (Why is no real title available?)
• Unambiguity in automata theory
• A generalized partition refinement algorithm, instantiated to language equivalence checking for weighted automata
• Integer Weighted Automata on Infinite Words
• scientific article; zbMATH DE number 7559503 (Why is no real title available?)
• Degree of sequentiality of weighted automata
• Inequality of finite behaviors of rational weight finite automata is in R
• When is containment decidable for probabilistic automata?
• Multi-Valued Reasoning about Reactive Systems
• When are emptiness and containment decidable for probabilistic automata?
• Copyless cost-register automata: structure, expressiveness, and closure properties
• The inclusion problem for weighted automata on infinite trees
• Polynomial time decidability of weighted synchronization under partial observability
• Non-deterministic weighted automata evaluated over Markov chains
• Weighted automata
• Best-by-simulations: a framework for comparing efficiency of reconfigurable architectures on workloads with deadlines
• Quantitative vs. weighted automata
• What's decidable about recursive hybrid automata?
• scientific article; zbMATH DE number 7407779 (Why is no real title available?)
• Weighted automata on infinite words in the context of attacker-defender games

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)