Matching Patterns with Variables
Data Structures and Algorithms
2019-07-30 v2 Computational Complexity
Formal Languages and Automata Theory
Abstract
A pattern p (i.e., a string of variables and terminals) matches a word w, if w can be obtained by uniformly replacing the variables of p by terminal words. The respective matching problem, i.e., deciding whether or not a given pattern matches a given word, is generally NP-complete, but can be solved in polynomial-time for classes of patterns with restricted structure. In this paper we overview a series of recent results related to efficient matching for patterns with variables, as well as a series of extensions of this problem.
Cite
@article{arxiv.1906.06965,
title = {Matching Patterns with Variables},
author = {Florin Manea and Markus L. Schmid},
journal= {arXiv preprint arXiv:1906.06965},
year = {2019}
}