Monotone Deterministic RL-Automata Don't Need Auxiliary Symbols.
Tomasz JurdzinskiFrantisek MrázFriedrich OttoMartin PlátekPublished in: Developments in Language Theory (2005)
Keyphrases
- reinforcement learning
- finite state automaton
- turing machine
- markov decision processes
- cellular automata
- deterministic finite automata
- finite automata
- multi agent
- black box
- finite state
- model free
- uniform distribution
- partially observable domains
- lattice gas
- probabilistic automata
- tree automata
- upper bound
- finite state machines
- regular expressions
- function approximation
- boolean functions
- optimal policy
- state space
- objective function