Login / Signup

PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance.

Nick PalmerPaul W. Goldberg
Published in: Theor. Comput. Sci. (2007)
Keyphrases
  • deterministic finite state automata
  • pac learnability
  • background knowledge
  • euclidean distance
  • decision trees
  • reinforcement learning
  • distance measure