[Translated] Maximal Article for Suffix Automaton

Правка en1, от Ahmad_Elsagheer, 2017-06-21 07:06:20

Hello Codeforces!

Suffix automaton is one of the interesting algorithms I learnt for strings. I was impressed by Maximal article for it and it helped me clearly grasp its concepts and applications. However, it is in Russian. I used yandex/google translate to understand it.

There are some articles for suffix automaton in English. Check here, here and here.

During an algorithms course, I was required to write a report for a non-basic data structure. I picked suffix automaton, so that It can be useful for anyone. It is compiled with LaTeX and there is a presentation that contains a visualization for it.

Here is the link. The article is not complete, but it contains the main points in Maximal article. It is just a translation for the original article (maybe I edited some parts, but not that much). If you need the source code, I can share it as well.

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский Ahmad_Elsagheer 2017-06-21 07:06:20 1177 Initial revision (published)