The Prague Stringology Club Workshop '97

Václav Snášel and Tomáš Koutný

Algebra of Pattern Matching Problems

In this paper we classify pattern matching problems using algebraic means. We construct an algebra of pattern matching automata in which finite automata are the elements and operations applied to them correspond to the creation of new pattern matching problems. We present several such operations and describe some identified properties of the algebra defined in this way.

Download paper: Article in PostScript Article in PDF
 PostScript   PDF