Questions tagged [string]
A competition to solve a particular problem through the usage and manipulation of strings.
1
question with no upvoted or accepted answers
5
votes
0
answers
188
views
Construct the suffix automaton
In computer science, a suffix automaton is the smallest partial deterministic finite automaton that recognizes the set of suffixes of a given string. (Wikipedia)
Given a string \$S\$ consisting of ...
- 659