60 search results - page 1 / 12 » An Optimal Parallel Algorithm for Learning DFA |
COLT
1994
Springer
13 years 8 months ago
1994
Springer
: Sequential algorithms given by Angluin 1987 and Schapire 1992 learn deterministic nite automata DFA exactly from Membership and Equivalence queries. These algorithms are feasible...
CEC
2003
IEEE
13 years 9 months ago
2003
IEEE
Learning Deterministic Finite Automata (DFA) is a hard task that has been much studied within machine learning and evolutionary computation research. This paper presents a new met...
JALC
2007
13 years 4 months ago
2007
We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...
AUSDM
2006
Springer
13 years 8 months ago
2006
Springer
The support vector machine (SVM) is a wellestablished and accurate supervised learning method for the classification of data in various application fields. The statistical learnin...
CONCUR
2006
Springer
13 years 6 months ago
2006
Springer
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...