Pattern matching with variables: a multivariate complexity analysis

DOI10.1016/j.ic.2015.03.006zbMath1370.68124MaRDI QIDQ2346415

Henning Fernau, Markus L. Schmid

Publication date: 1 June 2015

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2015.03.006

zbMATH Keywords

NP-completeness; morphisms; parameterised pattern matching; function matching; membership problem for pattern languages

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68Q45: Formal languages and automata

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)