scientific article; zbMATH DE number 67610

MaRDI QIDQ4013526zbMATH OpenFDO

Authors Michael Kearns, Leonard Pitt

Publication date 27 September 1992

zbMATH Keywords

learning from examplespattern languages

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• scientific article; zbMATH DE number 517032
• Learning a subclass of regular patterns in polynomial time
• Polynomial-time inference of arbitrary pattern languages
• scientific article; zbMATH DE number 1379106
• An average-case optimal one-variable pattern language learner

Cited in

(28)

• Identification of pattern languages from examples and queries
• PAC learning axis-aligned rectangles with respect to product distributions from multiple-instance examples
• An average-case optimal one-variable pattern language learner
• Regular patterns, regular languages and context-free languages
• Learnability of automatic classes
• On learning unions of pattern languages and tree patterns in the mistake bound model.
• Learning erasing pattern languages with queries
• Polynomial-time algorithms for learning typed pattern languages
• Polynomial Time Learning of Some Multiple Context-Free Languages with a Minimally Adequate Teacher
• scientific article; zbMATH DE number 3868655 (Why is no real title available?)
• DNA sequencing and string learning
• Polynomial Time Algorithms for Learning k-Reversible Languages and Pattern Languages with Correction Queries
• scientific article; zbMATH DE number 517032 (Why is no real title available?)
• Separating sets of strings by finding matching patterns is almost always hard
• Graph and string parameters: connections between pathwidth, cutwidth and the locality number
• scientific article; zbMATH DE number 7278096 (Why is no real title available?)
• Learning a subclass of regular patterns in polynomial time
• Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries
• Stochastic finite learning of the pattern languages
• Co-learning of recursive languages from positive data
• Case-based representation and learning of pattern languages
• Three \(\sum^ P_ 2\)-complete problems in computational learning theory
• Graph and string parameters: connections between pathwidth, cutwidth and the locality number
• Polynomial-time inference of arbitrary pattern languages
• Blocksequences of \(k\)-local words
• From learning in the limit to stochastic finite learning
• Learning a subclass of regular patterns in polynomial time
• Learning indexed families of recursive languages from positive data: A survey

This page was built for publication:

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