= Suffix automaton
{wiki=Suffix_automaton}
A **suffix automaton** is a type of automaton used to accept the set of suffixes of a given string. It's a powerful data structure in computer science, particularly in the fields of string processing and pattern matching. Here's a detailed explanation of the concept: \#\#\# Definition: A *suffix automaton* for a string \`S\` is a deterministic finite automaton (DFA) that has states corresponding to the distinct substrings of \`S\`.
Back to article page