The complexity of learning SUBSEQ (A)

Authors:
Stephen Fenner;William Gasarch
Affiliations:
Dept. of Computer Science and Engineering, University of South Carolina, SC, Columbia;Dept. of Computer Science and UMIACS, University of Maryland at College Park, College Park, MD
Venue:
ALT'06 Proceedings of the 17th international conference on Algorithmic Learning Theory
Year:
2006

Citing 12
Cited 0

Recursively enumerable sets and degrees

Recursively enumerable sets and degrees
Theory of recursive functions and effective computability

Theory of recursive functions and effective computability
Trade-off among parameters affecting inductive inference

Information and Computation
Learning via queries with teams and anomilies

COLT '90 Proceedings of the third annual workshop on Computational learning theory
Higher recursion theory

Higher recursion theory
Learning via queries

Journal of the ACM (JACM)
On the role of procrastination in machine learning

Information and Computation
Breaking the probability 12 barrier in FIN-type learning

Journal of Computer and System Sciences
On the structure of degrees of inferability

Journal of Computer and System Sciences
Inferring answers to queries

COLT '97 Proceedings of the tenth annual conference on Computational learning theory
Classification using information

Annals of Mathematics and Artificial Intelligence
Learning with Higher Order Additional Information

AII '94 Proceedings of the 4th International Workshop on Analogical and Inductive Inference: Algorithmic Learning Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.