Distinguishing pattern languages with membership examples

DOI10.1007/978-3-319-04921-2_43zbMATH Open1376.68075OpenAlexW115868610MaRDI QIDQ5404941FDOQ5404941

Authors: Zeinab Mazadi, Ziyuan Gao, Sandra Zilles 

Publication date: 31 March 2014

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-04921-2_43

Recommendations

• Distinguishing pattern languages with membership examples
• Erasing pattern languages distinguishable by a finite number of strings
• Finitely distinguishable erasing pattern languages
• Identification of pattern languages from examples and queries
• Learning Subclasses of Pure Pattern Languages

Mathematics Subject Classification ID

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

Cited In (9)

• Distinguishing pattern languages with membership examples
• The relation of two patterns with comparable languages patterns
• On the Teaching Complexity of Linear Sets
• Revisiting Shinohara's algorithm for computing descriptive patterns
• Classifying the arithmetical complexity of teaching models
• Finitely distinguishable erasing pattern languages
• On the teaching complexity of linear sets
• Title not available (Why is that?)
• Erasing pattern languages distinguishable by a finite number of strings

This page was built for publication: Distinguishing pattern languages with membership examples

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