Probabilistic Acceptors for Languages over Infinite Words

DOI10.1007/978-3-540-95891-8_3zbMath1206.68167OpenAlexW1505825970MaRDI QIDQ3599062

Marcus Größer, Nathalie Bertrand, Christel Baier

Publication date: 3 February 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-95891-8_3

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• On the undecidability of probabilistic planning and related stochastic optimization problems
• Undecidable problems for probabilistic automata of fixed dimension
• Automata, logics, and infinite games. A guide to current research
• A survey of algorithmic methods for partially observed Markov decision processes
• On the expressiveness and complexity of randomization in finite state monitors
• A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata
• Algorithms for Omega-Regular Games with Imperfect Information
• The Complexity of Markov Decision Processes
• State of the Art—A Survey of Partially Observable Markov Decision Processes: Theory, Models, and Algorithms
• The Optimal Control of Partially Observable Markov Processes over the Infinite Horizon: Discounted Costs
• The complexity of probabilistic verification
• On Decision Problems for Probabilistic Büchi Automata
• Some aspects of probabilistic automata
• Probabilistic automata

This page was built for publication: Probabilistic Acceptors for Languages over Infinite Words