String Matching FA

1.

Compute FA accepting P (m+1 states)

2.

Run FA with input string T, printing shift whenever accepting state is reached.

Example

P = yoyo, m=4

T = spin your yoyo

$\Sigma$ = {i, n, o, p, r, s, u, y}

Let X = $\Sigma$ - {y, o}