The complexity of learning SUBSEQ(A)

DOI10.2178/JSL/1245158093zbMATH Open1180.03041OpenAlexW2086713454MaRDI QIDQ3399186FDOQ3399186

S. Fenner, William Gasarch, Brian Postow

Publication date: 29 September 2009

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.135.2114

zbMATH Keywords

machine learningcomplexityformal languagesinductive inference

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational learning theory (68Q32) Applications of computability and recursion theory (03D80)

Cited In (2)

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

Recommendations

• Title not available (Why is that?) 👍 👎
• Computability-theoretic learning complexity 👍 👎
• On the Complexity of Learning Minimum Time-Bounded Turing Machines 👍 👎
• On the complexity of learning strings and sequences 👍 👎
• The Complexity of Learning SUBSEQ (A) 👍 👎
• On Sequences with Non-learnable Subsequences 👍 👎
• The complexity of finding SUBSEQ\((A)\) 👍 👎
• On the intrinsic complexity of learning recursive functions 👍 👎
• A learning algorithm for the longest common subsequence problem 👍 👎
• The query complexity of learning DFA 👍 👎

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 Q3399186)