Deciding the Value 1 Problem for Probabilistic Leaktight Automata

DOI10.1109/LICS.2012.40zbMath1360.68553OpenAlexW1997908831MaRDI QIDQ2986806

Youssouf Oualhadj, Hugo Gimbert, Nathanaël Fijalkow

Publication date: 16 May 2017

Published in: 2012 27th Annual IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/lics.2012.40

zbMATH Keywords

probabilistic automataalgebraic techniques in automata theoryvalue 1 problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Algebraic theory of languages and automata (68Q70) Decidability of theories and sets of sentences (03B25) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items

Stamina: stabilisation monoids in automata theory, Emptiness Under Isolation and the Value Problem for Hierarchical Probabilistic Automata, Decidable and expressive classes of probabilistic automata, Profinite techniques for probabilistic automata and the Markov monoid algorithm, Partial-Observation Stochastic Games, Unnamed Item, Unnamed Item, Deciding Maxmin Reachability in Half-Blind Stochastic Games, Probabilistic automata of bounded ambiguity, Probabilistic Automata of Bounded Ambiguity, Qualitative analysis of concurrent mean-payoff games