Freaks City

Generalized Suffix Automaton (GSAM) is a powerful structure for handling all suffixes of a trie (or multiple strings) with minimal DFA size. For a trie ( T ), we define "prefixes" (root-to-node strings), "suffixes" (node-to-leaf strrings), and "substrings" (path strings) similarly to single strings. GSAM is the min ...