Distinguishing pattern languages with membership examples

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. This is an expanded and corrected version of an earlier paper by Mazadi et al. (2014).