Analysis

Computing $\delta$: O(m )

FA-Matcher(T, $\delta$, m) $\;\;\;\;\;$ $\;\;\;\;\;$; O(n)
$\;\;\;\;\;$n = length(T)
$\;\;\;\;\;$s = s₀
$\;\;\;\;\;$for i = 1 to n
$\;\;\;\;\;$ $\;\;\;\;\;$s = $\delta$(s, T[i])
$\;\;\;\;\;$ $\;\;\;\;\;$if s = s_m
$\;\;\;\;\;$ $\;\;\;\;\;$then print ``Pattern occurs with shift'' (i-m)

This algorithm takes O(n + m ) time.