Suffix Automaton: Minimal DFA for All Substrings
A suffix automaton is the minimal deterministic finite automaton (DFA) that accepts exactly all substrings of a given string. If you’ve worked with suffix trees or suffix arrays, you know they’re…
Read more →