The smallest automaton accepting all suffixes of a string. The states form a directed acyclic word graph or DAWG.