Learning erasing pattern languages with queries

DOI10.1016/J.TCS.2005.09.001MaRDI QIDQ2581361zbMATH OpenOpenAlexFDO

Authors J. Nessel, S. Lange

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

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

Recommendations

• scientific article; zbMATH DE number 2080442
• Algorithmic Learning Theory
• Finitely distinguishable erasing pattern languages
• Learning languages and functions by erasing
• Erasing pattern languages distinguishable by a finite number of strings
• scientific article; zbMATH DE number 2143051
• Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries
• Learning Subclasses of Pure Pattern Languages
• Learning grammars and automata with queries

Cites work

• scientific article; zbMATH DE number 67610 (Why is no real title available?)
• scientific article; zbMATH DE number 1966625 (Why is no real title available?)
• scientific article; zbMATH DE number 2080645 (Why is no real title available?)
• scientific article; zbMATH DE number 1372670 (Why is no real title available?)
• scientific article; zbMATH DE number 3806956 (Why is no real title available?)
• scientific article; zbMATH DE number 743586 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• A theory of the learnable
• An average-case optimal one-variable pattern language learner
• Decision problems for patterns
• Finding patterns common to a set of strings
• Identification of pattern languages from examples and queries
• Language identification in the limit
• Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries
• Polynomial-time inference of arbitrary pattern languages
• Queries and concept learning

Cited in

(13)

• Learning a subclass of regular patterns in polynomial time
• Learning indexed families of recursive languages from positive data: A survey
• scientific article; zbMATH DE number 1910401 (Why is no real title available?)
• Learning of erasing primitive formal systems from positive examples
• Distinguishing relational pattern languages with a small number of short strings
• A non-learnable class of E-pattern languages
• scientific article; zbMATH DE number 2143051 (Why is no real title available?)
• scientific article; zbMATH DE number 2080442 (Why is no real title available?)
• Algorithmic Learning Theory
• Finitely distinguishable erasing pattern languages
• Automatic learning from positive data and negative counterexamples
• Learning by erasing
• Learning languages and functions by erasing

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

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