161 search results - page 3 / 33 » Learning Finite Automata Using Label Queries |
ACSC
2002
IEEE
14 years 10 days ago
2002
IEEE
We show how frequently occurring sequential patterns may be found from large datasets by first inducing a finite state automaton model describing the data, and then querying the m...
IJFCS
2008
13 years 7 months ago
2008
We consider the equivalence problem for labeled Markov chains (LMCs), where each state is labeled with an observation. Two LMCs are equivalent if every finite sequence of observat...
ICGI
1998
Springer
13 years 11 months ago
1998
Springer
We present in this paper a new learning problem called learning distributions from experts. In the case we study the experts are stochastic deterministic finite automata (sdfa). W...
ALT
1998
Springer
13 years 11 months ago
1998
Springer
Exact learning of half-spaces over finite subsets of IRn from membership queries is considered. We describe the minimum set of labelled examples separating the target concept from ...
WIA
1999
Springer
13 years 11 months ago
1999
Springer
Abstract. In computer science methods to aid learning are very imporcause abstract models are used frequently. For this conventional teaching methods do not suffice. We have develo...