On learning unions of pattern languages and tree patterns

DOI10.1007/3-540-46769-6_29MaRDI QIDQ4955324zbMATH OpenFDO

Authors Sally A. Goldman, Stephen S. Kwek

Publication date 25 May 2000

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

Full work available at URL https://doi.org/10.1007/3-540-46769-6_29

zbMATH Keywords

pattern language

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Learning unions of tree patterns using queries
• Learning unions of tree patterns using queries
• scientific article; zbMATH DE number 2143051
• scientific article; zbMATH DE number 996383
• scientific article; zbMATH DE number 408772
• scientific article; zbMATH DE number 522867
• Algorithmic Learning Theory
• Characteristic Sets for Inferring the Unions of the Tree Pattern Languages by the Most Fitting Hypotheses
• scientific article; zbMATH DE number 1954169

Cited in

(8)

• Learning unions of tree patterns using queries
• On learning unions of pattern languages and tree patterns in the mistake bound model.
• Combining pattern E-unification algorithms
• scientific article; zbMATH DE number 2086330 (Why is no real title available?)
• Learning Subclasses of Pure Pattern Languages
• Learning Unordered Tree Contraction Patterns in Polynomial Time
• Discovering unbounded unions of regular pattern languages from positive examples
• Automatic learning of subclasses of pattern languages

This page was built for publication: On learning unions of pattern languages and tree patterns

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