Skip to content
UPEEC

Suffix Automaton

The smallest automaton accepting all substrings of a string, built in $O(n)$.

Expert
Comments 0

Counts distinct substrings and answers substring queries quickly.

Spotted a mistake or want to add detail? Suggest an improvement — Content Contributors' edits are reviewed by editors before they go live.

Discussion (0)

Sign in or join free to ask questions and discuss this topic.