New Variants of Pattern Matching with Constants and Variables.
SOFSEM 2018: Theory and Practice of Computer Science - 44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, January 29 - February 2, 2018, Proceedings,
Lecture Notes in Computer Science Vol.10706, pp.611-623
(2018), [peer-reviewed]
Event Date:
February 2-2, 2018
Abstract / 概要
Given a text and a pattern over two types of symbols called constants and variables, the parameterized pattern matching problem is to find all occurrences of substrings of the text that the pattern matches by substituting a variable in the text for each variable in…