eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2018-02-12
24:1
24:14
10.4230/LIPIcs.FSTTCS.2017.24
article
Local Patterns
Day, Joel D.
Fleischmann, Pamela
Manea, Florin
Nowotka, Dirk
A pattern is a word consisting of constants from an alphabet Sigma of terminal symbols and variables from a set X. Given a pattern alpha, the decision-problem whether a given word w may be obtained by substituting the variables in \alpha for words over Sigma is called the matching problem. While this problem is, in general, NP-complete, several classes of patterns for which it can be efficiently solved are already known. We present two new classes of patterns, called k-local, and strongly-nested, and show that the respective matching problems, as well as membership can be solved efficiently for any fixed k.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol093-fsttcs2017/LIPIcs.FSTTCS.2017.24/LIPIcs.FSTTCS.2017.24.pdf
Patterns with Variables
Local Patterns
Combinatorial Pattern Matching
Descriptive Patterns