DAY, J.D., REIDENBACH, D. and SCHMID, M.L., 2016. Closure properties of pattern languages. Journal of Computer and System Sciences, In Press.
Pattern languages are a well-established class of languages, but very little is known about their closure properties. In the present paper we establish a large number of closure properties of the terminal-free pattern languages, and we characterise when the union of two terminal-free pattern languages is again a terminal-free pattern language. We demonstrate that the equivalent question for general pattern languages is characterised differently, and that it is linked to some of the most prominent open problems for pattern languages. We also provide fundamental insights into a well-known construction of E-pattern languages as unions of NE-pattern languages, and vice versa.
This paper is in closed access until 2nd Aug 2017.