Regular decision processes
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5547823 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 1315585 (Why is no real title available?)
- scientific article; zbMATH DE number 1556014 (Why is no real title available?)
- scientific article; zbMATH DE number 7354705 (Why is no real title available?)
- scientific article; zbMATH DE number 5685899 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- Deep reinforcement learning with temporal logics
- From Church and Prior to PSL
- Learning deterministic probabilistic automata from a model checking perspective
- Markov chains: models, algorithms and applications
- Nonapproximability results for partially observable Markov decision processes
- On the power of automata minimization in reactive synthesis
- On the undecidability of probabilistic planning and related stochastic optimization problems
- Optimal Control of Markov Decision Processes With Linear Temporal Logic Constraints
- Optimal control of Markov processes with incomplete state information
- Propositional dynamic logic of regular programs
- Reward machines: exploiting reward function structure in reinforcement learning
- The Complexity of Markov Decision Processes
- L^*-based learning of Markov decision processes
This page was built for publication: Regular decision processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6566638)