The Complexity of Learning SUBSEQ (A)

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.

• Type: Conference
• Year: 2006
• Where: ALT
• Authors: Stephen A. Fenner, William I. Gasarch
• Keywords: ALT 2006, Inductive Inference Problem, Machine Learning