Feb 11, 2020 · We present efficient algorithms for the matching problem with respect to patterns with a bounded number of repeated variables and patterns with a structural ...
A pattern α (i. e., a string of variables and terminals) matches a word w, if w can be obtained by uniformly replacing the variables of α by terminal words.
We present efficient algorithms for the matching problem with respect to patterns with a bounded number of repeated variables and patterns with a structural ...
Jul 29, 2019 · As we discuss efficient algorithms, it is important to describe the computational model we use in this work. This is the standard unit-cost RAM ...
Oct 29, 2019 · We present efficient algorithms for the matching problem with respect to patterns with a bounded number of repeated variables and patterns with ...
We present efficient algorithms for the matching problem with respect to patterns with a bounded number of repeated variables and patterns with a structural ...
Pattern Matching with Variables. Efficient Algorithms and Complexity Results. Henning Fernau, Florin Manea, Robert Mercaş, Markus L. Schmid. ACM Transactions ...
People also ask
What is the complexity of pattern matching algorithm?
Which algorithm is used for pattern matching?
What are the advantages of pattern matching algorithm with respect to real time applications?
Which of the algorithms are used for string and pattern matching problems?
Find an efficient algorithm that solves the matching problem for K. The main class of patters we consider is that of patterns with bounded scope coincidence.
Highlights · The matching problem for patterns with variables is investigated. · The NP-completeness for a strongly restricted version of this problem is shown.
In the present work, a detailed complexity analysis of a computationally hard pattern matching problem is provided. The patterns considered in this context are ...