What's decidable about weighted automata?
From MaRDI portal
Publication:3172937
DOI10.1007/978-3-642-24372-1_37zbMATH Open1348.68089OpenAlexW1835836356MaRDI QIDQ3172937FDOQ3172937
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
Recommendations
Cited In (51)
- On computability and some decision problems of parametric weighted finite automata
- Title not available (Why is that?)
- Coalgebras for Bisimulation of Weighted Automata over Semirings
- Integer weighted automata on infinite words
- Integer Weighted Automata on Infinite Words
- Parameterized weighted containment
- 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
- Polynomial time decidability of weighted synchronization under partial observability
- How to Tackle Integer Weighted Automata Positivity
- 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
- Where automatic structures benefit from weighted automata
- What's decidable about recursive hybrid automata?
- Querying best paths in graph databases
- Weighted automata on infinite words in the context of attacker-defender games
- Image-binary automata
- Weak cost register automata are still powerful
- The big-O problem
- Inequality of finite behaviors of rational weight finite automata is in R
- The big-O problem for labelled Markov chains and weighted automata
- On polynomial recursive sequences
- Compositional branching-time measurements
- 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?)
- Pumping lemmas for weighted automata
- Isomorphisms of scattered automatic linear orders
- Streamable regular transductions
- Polynomial automata: zeroness and applications
- Determinisability of unary weighted automata over the rational numbers
- Title not available (Why is that?)
- A generalized partition refinement algorithm, instantiated to language equivalence checking for weighted automata
- Weighted automata on infinite words in the context of attacker-defender games
- The validity of weighted automata
- When is containment decidable for probabilistic automata?
- When are emptiness and containment decidable for probabilistic automata?
- Weighted automata
- Finite-valued weighted automata
- Containment and equivalence of weighted automata: probabilistic and max-plus cases
- Unambiguity in automata theory
- Degree of sequentiality of weighted automata
- Quantitative vs. weighted automata
- Multi-Valued Reasoning about Reactive Systems
- The inclusion problem for weighted automata on infinite trees
- 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)
