On computing indistinguishable states of nondeterministic finite automata with partially observable transitions.
David SearsKaren RudiePublished in: CDC (2014)
Keyphrases
- finite automata
- partially observable
- finite automaton
- markov decision problems
- fully observable
- state space
- belief state
- state transition
- deterministic automata
- dynamical systems
- decision problems
- grammatical inference
- regular expressions
- markov decision processes
- partial observability
- reinforcement learning
- tree automata
- state transitions
- partially observable environments
- partial observations
- infinite horizon
- hidden state
- action models
- state variables
- initial state
- finite state
- reward function
- belief space
- computational complexity
- inductive inference
- dynamic systems
- planning problems
- heuristic search
- markov chain
- np hard