+44 (0)1509 263171
Please use this identifier to cite or link to this item:
|Title: ||Closure properties of pattern languages|
|Authors: ||Day, Joel D.|
Schmid, Markus L.
|Keywords: ||Pattern languages|
|Issue Date: ||2016|
|Publisher: ||© Elsevier|
|Citation: ||DAY, J.D., REIDENBACH, D. and SCHMID, M.L., 2016. Closure properties of pattern languages. Journal of Computer and System Sciences, 84, pp. 11-31.|
|Abstract: ||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.|
|Description: ||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.003|
|Version: ||Accepted for publication|
|Publisher Link: ||http://dx.doi.org/10.1016/j.jcss.2016.07.003|
|Appears in Collections:||Published Articles (Computer Science)|
Files associated with this item:
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.