Login / Signup

On the Gap-Complexity of Simple RL-Automata.

Frantisek MrázFriedrich OttoMartin Plátek
Published in: Developments in Language Theory (2006)
Keyphrases
  • reinforcement learning
  • computational complexity
  • worst case
  • case study
  • search algorithm
  • search space
  • model checking
  • decision problems
  • function approximation
  • regular expressions
  • turing machine