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/9556

Title: Patterns with bounded treewidth
Authors: Reidenbach, Daniel
Schmid, Markus L.
Keywords: Pattern languages
Membership problem
Treewidth
Extended regular expressions
Issue Date: 2012
Publisher: © Springer-Verlag
Citation: REIDENBACH, D. and SCHMID, M.L., 2012. Patterns with bounded treewidth. Language and Automata Theory and Applications; Lecture Notes in Computer Science, 7183, pp. 468 - 479.
Abstract: We show that any parameter of patterns that is an upper bound for the treewidth of appropriate encodings of patterns as relational structures, if restricted to a constant, allows the membership problem for pattern languages to be solved in polynomial time. Furthermore, we identify a new such parameter, called the scope coincidence degree.
Description: This article was published in Lecture Notes in Computer Science [© Springer-Verlag] and the definitive version is available at: http://dx.doi.org/10.1007/978-3-642-28332-1_40
Version: Accepted for publication
DOI: 10.1007/978-3-642-28332-1_40
URI: https://dspace.lboro.ac.uk/2134/9556
Publisher Link: http://dx.doi.org/10.1007/978-3-642-28332-1_40
ISBN: 9783642283314
ISSN: 0302-9743
Appears in Collections:Published Articles (Computer Science)

Files associated with this item:

File Description SizeFormat
Reidenbach_Schmid_LATA_2012_Patterns_with_bounded_treewidth_Final_version.pdf307.69 kBAdobe PDFView/Open

 

SFX Query

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