Day_Reidenbach_Schmid_DLT14_journal_version_FINAL.pdf (365.64 kB)
Closure properties of pattern languages
journal contribution
posted on 2016-08-05, 08:49 authored by Joel DayJoel Day, Daniel Reidenbach, Markus L. SchmidPattern 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.
History
School
- Science
Department
- Computer Science
Published in
Journal of Computer and System SciencesVolume
84Pages
11 - 31Citation
DAY, J.D., REIDENBACH, D. and SCHMID, M.L., 2017. Closure properties of pattern languages. Journal of Computer and System Sciences, 84, pp. 11-31.Publisher
© ElsevierVersion
- AM (Accepted Manuscript)
Publisher statement
This work is made available according to the conditions of the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) licence. Full details of this licence are available at: https://creativecommons.org/licenses/by-nc-nd/4.0/Acceptance date
2016-07-07Publication date
2016-08-02Notes
This paper was accepted for publication in the journal Journal of Computer and System Sciences and the definitive published version is available at http://dx.doi.org/10.1016/j.jcss.2016.07.003ISSN
0022-0000eISSN
1090-2724Publisher version
Language
- en