Deciding the value 1 problem for probabilistic leaktight automata

DOI10.2168/LMCS-11(2:12)2015zbMath1391.68081arXiv1504.04136MaRDI QIDQ2941760

Youssouf Oualhadj, Hugo Gimbert, Edon Kelmendi, Nathanaël Fijalkow

Publication date: 25 August 2015

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.04136

zbMATH Keywords

probabilistic automatavalue-1 problem

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (10)

Stamina: stabilisation monoids in automata theory ⋮ When are emptiness and containment decidable for probabilistic automata? ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Decidable and expressive classes of probabilistic automata ⋮ Profinite techniques for probabilistic automata and the Markov monoid algorithm ⋮ Unnamed Item ⋮ Deciding Maxmin Reachability in Half-Blind Stochastic Games ⋮ Probabilistic automata of bounded ambiguity ⋮ Probabilistic Automata of Bounded Ambiguity

This page was built for publication: Deciding the value 1 problem for probabilistic leaktight automata