Regular and context-free pattern languages over small alphabets

2014-01-23T14:00:26Z (GMT) by Daniel Reidenbach Markus L. Schmid
Pattern languages are generalisations of the copy language, which is a standard textbook example of a context-sensitive and non-context-free language. In this work, we investigate a counter-intuitive phenomenon: with respect to alphabets of size 2 and 3, pattern languages can be regular or context-free in an unexpected way. For this regularity and context-freeness of pattern languages, we give several sufficient and necessary conditions and improve known results.