Closure Properties of Pattern Languages
Pattern languages are a well-established class of languages that is particularly popular in algorithmic learning theory, 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.
KeywordsPattern languages Closure properties
Unable to display preview. Download preview PDF.
- 2.Bayer, H.: Allgemeine Eigenschaften von Patternsprachen. Projektarbeit, Fachbereich Informatik, Universität Kaiserslautern (2007) (in German)Google Scholar
- 4.Fernau, H., Schmid, M.L., Villanger, Y.: On the parameterised complexity of string morphism problems. In: Proc. 33rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2013. Leibniz International Proceedings in Informatics (LIPIcs), vol. 24, pp. 55–66 (2013)Google Scholar
- 13.Reidenbach, D., Schmid, M.L.: Patterns with bounded treewidth. Information and Computation (to appear)Google Scholar
- 17.Wright, K.: Identification of unions of languages drawn from an identifiable class. In: Proc. 2nd Annual Workshop on Computational Learning Theory, COLT 1989, pp. 328–333 (1989)Google Scholar