Abstract
This article determines two learning-theoretic combinatorial parameters, the teaching dimension and the recursive teaching dimension, for various families of pattern languages over alphabets of varying size. Our results and formal proofs are of relevance to recent studies in computational learning theory as well as in formal language theory. © 2014 Springer International Publishing.
Cite
CITATION STYLE
Mazadi, Z., Gao, Z., & Zilles, S. (2014). Distinguishing pattern languages with membership examples. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8370 LNCS, pp. 528–540). https://doi.org/10.1007/978-3-319-04921-2_43
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
