Erasing pattern languages distinguishable by a finite number of strings

MaRDI QIDQ4645637zbMATH OpenFDO

Authors Fahimeh Bayeh, Ziyuan Gao, Sandra Zilles

Publication date 10 January 2019

Full work available at URL http://proceedings.mlr.press/v76/bayeh17a.html

zbMATH Keywords

pattern languagesrecursive teaching dimensionteaching dimension

Mathematics Subject Classification ID

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

Recommendations

• Finitely distinguishable erasing pattern languages
• Distinguishing pattern languages with membership examples
• Distinguishing pattern languages with membership examples
• Learning Theory
• scientific article; zbMATH DE number 522839

Cited in

(5)

• Finitely distinguishable erasing pattern languages
• The teaching complexity of erasing pattern languages with bounded variable frequency
• Distinguishing pattern languages with membership examples
• Learning erasing pattern languages with queries
• Distinguishing pattern languages with membership examples

This page was built for publication: Erasing pattern languages distinguishable by a finite number of strings

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