Sciweavers

Share
65 search results - page 1 / 13
» An Optimal Parallel Algorithm for Learning DFA
Sort
View
COLT
1994
Springer
10 years 2 months ago
An Optimal Parallel Algorithm for Learning DFA
: Sequential algorithms given by Angluin 1987 and Schapire 1992 learn deterministic nite automata DFA exactly from Membership and Equivalence queries. These algorithms are feasible...
José L. Balcázar, Josep Díaz,...
CEC
2003
IEEE
10 years 3 months ago
Learning DFA: evolution versus evidence driven state merging
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...
Simon M. Lucas, T. Jeff Reynolds
JALC
2007
90views more  JALC 2007»
9 years 10 months ago
Learning Unary Automata
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...
Gregor Gramlich, Ralf Herrmann
AUSDM
2006
Springer
177views Data Mining» more  AUSDM 2006»
10 years 2 months ago
On The Optimal Working Set Size in Serial and Parallel Support Vector Machine Learning With The Decomposition Algorithm
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...
Tatjana Eitrich, Bruno Lang
CONCUR
2006
Springer
10 years 9 days ago
Inference of Event-Recording Automata Using Timed Decision Trees
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...
Olga Grinchtein, Bengt Jonsson, Paul Pettersson
books