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

Title: Patterns with bounded treewidth [internal report]
Authors: Reidenbach, Daniel
Schmid, Markus L.
Issue Date: Jun-2012
Publisher: Department of Computer Science, Loughborough University
Citation: REIDENBACH, D. and SCHMID, M.L., 2012. Patterns with bounded treewidth. Internal Report 1109, Department of Computer Science, Loughborough University
Abstract: A pattern is a string consisting of variables and terminal symbols, and its language is the set of all words that can be obtained by substi- tuting arbitrary words for the variables. The membership problem for pattern languages, i. e., deciding on whether or not a given word is in the pattern language of a given pattern is NP-complete. We show that any parameter of patterns that is an upper bound for the treewidth of appro- priate encodings of patterns as relational structures, if restricted, allows the membership problem for pattern languages to be solved in polynomial time. Furthermore, we identify new such parameters.
Description: This internal report is the full version of a paper previously presented at the conference LATA 2012 (available on the Institutional Repository at: https://dspace.lboro.ac.uk/dspace-jspui/handle/2134/9556)
Version: Published
URI: https://dspace.lboro.ac.uk/2134/10118
Appears in Collections:Working Papers (Computer Science)

Files associated with this item:

File Description SizeFormat
Reidenbach_Schmid_Internal_Report_1109_Patterns_with_bounded_treewidth.pdf405.28 kBAdobe PDFView/Open

 

SFX Query

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