Sunday, March 31, 2013

Finite automata and string matching

Finite automata and string matching: "The KMP algorithm works by turning the pattern it's given into a machine, and then running the machine. The hard part of KMP is finding the machine.

We need some restrictions on what we mean by "program". This is where "deterministic & finite" come from."

'via Blog this'