Parallel String Matching with Variable L
β
A.A. Bertossi; F. Logi
π
Article
π
1994
π
Elsevier Science
π
English
β 450 KB
String matching is the problem of finding all the occurrences of a pattern \(P\) in a text \(T\), where \(P\) and \(T\) are strings over a finite alphabet \(\mathbf{\Sigma}\). A variable length don't care is a special character, not belonging to \(\Sigma\), which can match any string in \(\Sigma^{*}