Learning erasing pattern languages with queries

DOI10.1016/j.tcs.2005.09.001zbMath1081.68049OpenAlexW2173289590MaRDI QIDQ2581361

Steffen Lange, Jochen Nessel

Publication date: 10 January 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.09.001

zbMATH Keywords

Formal language theoryAlgorithmic learningQuery inference

Mathematics Subject Classification ID

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

Related Items (3)

Learning indexed families of recursive languages from positive data: A survey ⋮ Automatic learning from positive data and negative counterexamples ⋮ Finitely distinguishable erasing pattern languages

Cites Work

• Polynomial-time inference of arbitrary pattern languages
• Identification of pattern languages from examples and queries
• Finding patterns common to a set of strings
• An average-case optimal one-variable pattern language learner
• Decision problems for patterns
• Queries and concept learning
• A theory of the learnable
• Language identification in the limit
• Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Learning erasing pattern languages with queries