Forgot parenthesis around minlen(v) expansion

mhayter · web-flow · commit 9075aed4a95c · 2023-04-30T21:01:18.000-04:00
diff --git a/src/string/suffix-automaton.md b/src/string/suffix-automaton.md
@@ -496,7 +496,7 @@ Total time complexity: $O(length(S))$
 
 
 Alternatively, we can take advantage of the fact that each state $v$ matches to substrings of length $[minlen(v),len(v)]$.
-Therefore, given $minlen(v) = 1 + len(link(v))$, we have total distinct substrings at state $v$ being $len(v) - minlen(v) + 1 = len(v) - 1 + len(link(v)) + 1 = len(v) - len(link(v))$.
+Therefore, given $minlen(v) = 1 + len(link(v))$, we have total distinct substrings at state $v$ being $len(v) - minlen(v) + 1 = len(v) - (1 + len(link(v))) + 1 = len(v) - len(link(v))$.
 
 This is demonstrated succinctly below:
 
