A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
An Extension of Finite-state Markov Decision Process and an Application of Grammatical Inference
[chapter]
2008
Reinforcement Learning
Reinforcement Learning: Theory and Applications 86 positive data, the one computing a most general grammar and the modified update equations of some usual reinforcement learning methods. Notation and definitions Before we give the definition of simple context-free MDPs, we write some standard notation and definitions and introduce subclasses of simple grammars and probabilistic grammars. A context-free grammar (CFG) is a quadruple denoted by , where V is a finite set of nonterminal symbols, Σ
doi:10.5772/5276
fatcat:2rtphxd6sne2jftvmxqc3zf3qi