Probabilistic Automata on Infinite Words: Decidability and Undecidability Results

DOI10.1007/978-3-642-15643-4_1zbMath1305.68112OpenAlexW1485231064MaRDI QIDQ4931278

Krishnendu Chatterjee, Thomas A. Henzinger

Publication date: 4 October 2010

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-15643-4_1

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)

Related Items (3)

What is decidable about partially observable Markov decision processes with \(\omega\)-regular objectives ⋮ Reachability analysis of quantum Markov decision processes ⋮ Decidable and expressive classes of probabilistic automata

This page was built for publication: Probabilistic Automata on Infinite Words: Decidability and Undecidability Results