Loughborough University
Leicestershire, UK
LE11 3TU
+44 (0)1509 263171
Loughborough University

Loughborough University Institutional Repository

Please use this identifier to cite or link to this item: https://dspace.lboro.ac.uk/2134/14012

Title: Regular and context-free pattern languages over small alphabets
Authors: Reidenbach, Daniel
Schmid, Markus L.
Keywords: Pattern languages
Regular languages
Context-free languages
Issue Date: 2013
Publisher: © Elsevier
Citation: REIDENBACH, D. and SCHMID, M.L., 2013. Regular and context-free pattern languages over small alphabets. Theoretical Computer Science, 518, pp.80–95.
Abstract: Pattern languages are generalisations of the copy language, which is a standard textbook example of a context-sensitive and non-context-free language. In this work, we investigate a counter-intuitive phenomenon: with respect to alphabets of size 2 and 3, pattern languages can be regular or context-free in an unexpected way. For this regularity and context-freeness of pattern languages, we give several sufficient and necessary conditions and improve known results.
Description: This is the author’s version of a work that was accepted for publication in the journal, Theoretical Computer Science. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published: http://dx.doi.org/10.1016/j.tcs.2013.07.035
Version: Accepted for publication
DOI: 10.1016/j.tcs.2013.07.035
URI: https://dspace.lboro.ac.uk/2134/14012
Publisher Link: http://dx.doi.org/10.1016/j.tcs.2013.07.035
ISSN: 0304-3975
Appears in Collections:Published Articles (Computer Science)

Files associated with this item:

File Description SizeFormat
Reidenbach_Schmid_TCS_Regular_and_context_free_pattern_languages.pdfAccepted version428.57 kBAdobe PDFView/Open


SFX Query

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.