By adamant, history, 5 years ago, translation,

Hi everyone!

This summer in Moscow IPT was held Moscow International Workshop ACM ICPC. I gave a lecture on suffix structures there (it was only about suffix automaton and suffix tree actually). In this regard, I would like to present to you the lecture notes. So here are Russian and English versions. Enjoy and Happy Holidays :)

P. S. My very apologies for my bad English :(

UPD: Thanks to Burunduk1 for help in code formatting.

• +209

 » 5 years ago, # |   +7 Hi, first of all thanks a lot, and secondly would you mind tagging this with tutorial so it would be easier to search for in the future? I looked at the notes, and they are definitely not to be missed out on!
•  » » 5 years ago, # ^ |   0 Here you go :)
 » 5 years ago, # |   0 I was reading your excellent tutorial and got confused by one sentence(paragraph). Could you plz explain it to me?Pretty easy to understand that in case of suffix automaton right conext X(a) of string a has mutual correspondence with the set of right positions of occurrences of the string a in the string s. Indeed, if ax is accepted by automaton, that is, it is a suffix of s, then s = yax, and the string x can be matched with position |s| − |x| − 1. Thus, each state of the automaton accepts strings with the same set of right positions of occurrences in s and vice versa all strings with such set of positions is accepted by this state.I couldn't understand the first sentence clearly. Thanks for helping.
•  » » 5 years ago, # ^ |   0 To each element in right conext you can associate the occurence in string. And vice versa.For example, let . We can find that and associate it with first occurence of ab ( ab acaba). And for second occurence there is element in right context: (abac ab a).
•  » » » 5 years ago, # ^ |   0 I understand the example and sort of getting your idea, but what does "mutual correspondence" mean?
•  » » » » 5 years ago, # ^ |   0 It means bijection :)
•  » » » » » 5 years ago, # ^ |   0 do I need to work more on this paragraph if I can understand your example but not really for the text?
•  » » » » » » 5 years ago, # ^ |   0 Maybe no. Try going on without it and return to it if you have some difficulties maybe
 » 4 years ago, # |   0 Thanks for the awesome resource. Could you provide links to other resources from the workshop too(like others' notes). Thank You!