Abstract
Higman showed1 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. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Fenner, S., & Gasarch, W. (2006). The complexity of learning SUBSEQ(A). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4264 LNAI, pp. 109–123). Springer Verlag. https://doi.org/10.1007/11894841_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
