Builds a deterministic finite automaton (DFA) for pattern matching over a
`ByteString`.
The automaton encodes transitions from `(state, input byte)` to the next
DFA state.
Unlike the previous implementation, transition-table positions and
transition values are represented by bounded `Index` values. Bounds are
established while constructing the automaton and are erased at runtime.
The resulting search-time transition path therefore requires no
`tryNatToFin`, `tryIndex`, or other dynamic DFA-table bounds conversion.
Totality: total
Visibility: export