Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

ALT
2006
Springer

favoriteEmaildiscussreport

78views Machine Learning» more ALT 2006»

The Complexity of Learning SUBSEQ (A)

14 years 1 months ago

The Complexity of Learning SUBSEQ (A)

Download www.cs.umd.edu

Higman showed that if A is any language then SUBSEQ(A) is regular, where SUBSEQ(A) is the language of all subsequences of strings in A. We consider the following inductive inference problem: given A(ε), A(0), A(1), A(00), . . . learn, in the limit, a DFA for SUBSEQ(A). We consider this model of learning and the variants of it that are usually studied in inductive inference: anomalies, mindchanges, and teams.

Stephen A. Fenner, William I. Gasarch

Real-time Traffic

ALT 2006 | Inductive Inference Problem | Machine Learning |

claim paper

Related Content

» Tumble Tree Reducing Complexity of the Growing Cells Approach

» A bound on the label complexity of agnostic active learning

» A1 enduser programming for webbased system administration

» Agnostic active learning

» A Standardsbased Modelling Approach for Dynamic Generation of Adaptive Learning Scenarios

» Using unsupervised analysis to constrain generalization bounds for support vector classifi...

» Fast SDP Relaxations of Graph Cut Clustering Transduction and Other Combinatorial Problem

» Learning the Morphological Diversity

» Integrating a Flexible Representation Machinery in a Model of Human Concept Learning

Post Info
More Details (n/a)

Added	14 Mar 2010
Updated	14 Mar 2010
Type	Conference
Year	2006
Where	ALT
Authors	Stephen A. Fenner, William I. Gasarch

Comments (0)