Can someone please explain the suffix automaton algorithm as I have read from all possible sources but still no clue. And also what does this algorithm give (I mean like in suffix array it is sorted suffixes of string).Also is Finite Automata same as suffix automaton.If no please can you mention the purpose of FA. I understood its algorithm but _ am unable to get its intuition and the purpose it's used.If someone can explain, I'll be highly obliged._ I know this is lot of work to explain but you can downvote the post if you like but please explain. Thanx .
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3831 |
| 3 | Radewoosh | 3646 |
| 4 | jqdai0815 | 3620 |
| 4 | Benq | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | gamegame | 3386 |
| 10 | ksun48 | 3373 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 160 |
| 5 | -is-this-fft- | 158 |
| 6 | awoo | 157 |
| 7 | adamant | 156 |
| 8 | TheScrasse | 154 |
| 8 | nor | 154 |
| 10 | Dominater069 | 153 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Nov/09/2024 06:40:38 (k2).
Desktop version, switch to mobile version.
Supported by
Actually suffix automaton is acyclic directed graph of words. Every path from starting vertex will be substring of given string. As it is acyclic directed graph, it's easy to build many different dp on this graph.