Theoremcore
Suffix automaton size theorem
Also called linear size of suffix automata.
A suffix automaton of an n-character string has at most 2n-1 states and 3n-4 transitions.
A suffix automaton of an n-character string has at most 2n-1 states and 3n-4 transitions.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag AQCD8D Edit this page History Report an error