CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
Closure properties of pattern languages
Authors
Daniel Reidenbach (1256598)
Joel Day (5986415)
Markus L. Schmid (7167803)
Publication date
1 January 2014
Publisher
Abstract
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. © 2014 Springer International Publishing Switzerland
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
Loughborough University Institutional Repository
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:figshare.com:article/94048...
Last time updated on 26/03/2020