A note on the complexity of matching patterns with variables

作者：Schmid Markus L^*

来源：Information Processing Letters, 2013, 113(19-21): 729-733.

DOI：10.1016/j.ipl.2013.06.011

• Computational complexity
• Formal languages
• Pattern matching with variables
• Parameterised pattern matching
• NP-complete problems
• Membership problem for pattern languages

A word matches a pattern with variables (i.e., a string that contains terminal symbols and variable symbols) if and only if it can be obtained from the pattern by substituting the variables by terminal words. To decide for a given word whether or not it matches a pattern with variables is an NP-complete problem, which has been independently discovered and investigated in different areas of theoretical computer science and which has applications in various contexts. In this work, we show that the problem of matching patterns with variables remains NP-complete even if every variable has at most two occurrences. In addition to this, we show that if patterns can be represented as special kinds of planar graphs, then they can be matched in polynomial time.

• 出版日期2013-10