A DFA inner loop looks tiny, yet every next transition depends on the previous one. I explain dependency chains, cache locality, and why fewer instructions need not mean huge speedups.
Rust's Aho–Corasick crate can build three different automata. I compare their construction cost, memory layout, search behavior, and the evidence needed before forcing one.