Distinguishing relational pattern languages with a small number of short strings

MaRDI QIDQ7028768zbMATH OpenFDO

Authors Robert C. Holte, S. Mahmoud Mousawi, Sandra Zilles

Publication date 11 February 2025

Full work available at URL https://proceedings.mlr.press/v167/holte22a.html

zbMATH Keywords

equivalence problempattern languagesteaching dimension

Mathematics Subject Classification ID

Knowledge representation (68T30)

Cites work

• A machine discovery from amino acid sequences by decision trees over regular patterns
• Algorithmic Learning Theory
• Bad news on decision problems for patterns
• Characteristic sets for polynomial grammatical inference
• Discontinuities in pattern inference
• Distinguishing pattern languages with membership examples
• Editing by example
• Finding patterns common to a set of strings
• Finitely distinguishable erasing pattern languages
• scientific article; zbMATH DE number 3806956 (Why is no real title available?)
• Inductive inference of formal languages from positive data
• Language identification in the limit
• Learning erasing pattern languages with queries
• Learning relational patterns
• On the complexity of teaching
• Optimal collusion-free teaching
• Polynomial-time algorithms for learning typed pattern languages
• Queries and concept learning
• Teachability in computational learning
• Teaching a smarter learner.
• The complexity of exact learning of acyclic conditional preference networks from swap examples

This page was built for publication: Distinguishing relational pattern languages with a small number of short strings

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