2 papers
cs.CC2016
Optimal pattern matching algorithms
Gilles Didier
We study a class of finite state machines, called \defi{-matching machines}, which yield to simulate the behavior of pattern matching algorithms while searching for a pattern $w…
cs.DS2016
Designing optimal- and fast-on-average pattern matching algorithms
Gilles Didier, Laurent Tichit
Given a pattern and a text , the speed of a pattern matching algorithm over with regard to , is the ratio of the length of to the number of text accesses performe…