Non-deterministic weighted automata evaluated over Markov chains
DOI10.1016/j.jcss.2019.10.001zbMath1436.68182arXiv1908.04625OpenAlexW2982254759WikidataQ126983670 ScholiaQ126983670MaRDI QIDQ2009651
Publication date: 29 November 2019
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1908.04625
Analysis of algorithms (68W40) Formal languages and automata (68Q45) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Approximation algorithms (68W25) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complexity of computing the permanent
- Handbook of weighted automata
- Convex language semantics for nondeterministic probabilistic automata
- Strategy synthesis for multi-dimensional quantitative objectives
- Model measuring for discrete and hybrid systems
- Optimal control of Markov processes with incomplete state information
- Reasoning about online algorithms with weighted automata
- Quantitative languages
- Approximate Determinization of Quantitative Automata
- What’s Decidable about Weighted Automata?
- A Survey of Stochastic Games with Limsup and Liminf Objectives
- THE EQUALITY PROBLEM FOR RATIONAL SERIES WITH MULTIPLICITIES IN THE TROPICAL SEMIRING IS UNDECIDABLE
- The complexity of probabilistic verification
- Markov Chains and Unambiguous Büchi Automata
- Quantitative Automata under Probabilistic Semantics
- Non-deterministic Weighted Automata on Random Words
- Predicate abstraction and refinement for verifying multi-threaded programs
- Rational approximations to algebraic numbers
- Percentile queries in multi-dimensional Markov decision processes
This page was built for publication: Non-deterministic weighted automata evaluated over Markov chains
