P-Hardness of Equivalence Testing on Finite-State Processes.
Zdenek SawaPetr JancarPublished in: SOFSEM (2001)
Keyphrases
- finite state
- markov chain
- markov decision processes
- model checking
- optimal policy
- context free
- tree automata
- reinforcement learning
- action sets
- vector quantizer
- stochastic processes
- partially observable markov decision processes
- continuous time markov process
- information retrieval
- continuous time bayesian networks
- transition systems
- computational complexity
- search algorithm
- learning algorithm