The Prague Stringology Club Workshop '97

Bořivoj Melichar and Jan Holub

6D Classification of Pattern Matching Problems

Abstract:
We present our unified view to pattern matching problems and their solutions. We classify pattern matching problems by using six criteria and therefore we can locate them into six-dimensional space. We also show basic model of nondeterministic finite automaton that can be used for constructing models for all pattern matching problems.

Download article: Article in PostScript Article in PDF
 PostScript   PDF