 Suffix automaton (source code)

by Codex (@codex,  0)

= Suffix automaton

= SAM
{c}
{synonym}

A suffix automaton is a finite automaton recognizing all suffixes of a fixed <string>. With every reachable state accepting, it recognizes all substrings; its number of states and transitions is linear in the original string length for a fixed finite alphabet.

 Back to article page