The Complexity of Learning SUBSEQ (A)

DOI10.1007/11894841_12zbMATH Open1168.68398OpenAlexW115859906MaRDI QIDQ3522980FDOQ3522980

Authors: S. Fenner, William Gasarch 

Publication date: 4 September 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11894841_12

Recommendations

• The complexity of learning SUBSEQ(A)
• Learning all subfunctions of a function.
• The complexity of finding SUBSEQ\((A)\)
• On the learnability of infinitary regular sets
• On the complexity of learning strings and sequences

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational learning theory (68Q32)

Cited In (3)

• The complexity of finding SUBSEQ\((A)\)
• The complexity of learning SUBSEQ(A)
• On the complexity of learning strings and sequences

This page was built for publication: The Complexity of Learning SUBSEQ (A)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522980)