72 search results - page 5 / 15 » Learning Stochastic Finite Automata |
SIGCSE
2006
ACM
14 years 1 months ago
2006
ACM
Visualization and interactivity are valuable active learning techniques that can improve mastery of difficult concepts. In this paper we describe jFAST, an easy-to-use graphical s...
TSMC
1998
13 years 7 months ago
1998
—Consider the problem of a robot (learning mechanism or algorithm) attempting to locate a point on a line. The mechanism interacts with a random environment which essentially inf...
ALT
2005
Springer
2005
Springer
PAC-Learnability of Probabilistic Deterministic Finite State Automata in Terms of Variation Distance
14 years 4 months ago
We consider the problem of PAC-learning distributions over strings, represented by probabilistic deterministic finite automata (PDFAs). PDFAs are a probabilistic model for the gen...
FSMNLP
2009
Springer
13 years 5 months ago
2009
Springer
Abstract. Active language learning is an interesting task for which theoretical results are known and several applications exist. In order to better understand what the better stra...
SAGA
2001
Springer
13 years 12 months ago
2001
Springer
Inductive inference can be considered as one of the fundamental paradigms of algorithmic learning theory. We survey results recently obtained and show their impact to potential ap...