Кристиян Хараламбиев - ФМИ, СУ

1. The pattern-matching problem and its naive solution.

2. Fundamental preprocessing algorithm:
Z-algorithm. Its application as a linear-time pattern-matching algorithm.

3. Knuth-Morris-Pratt algorithm (a linear-time pattern-matching algorithm):
  3a. KMP using Z-algorithm for preprocessing.
  3b. KMP using its orignal preprocessing.
  3c. Comparison between 3a & 3b and the way the compute (optimized) suffix-preffix values.

4. One interesing problem:
Find the maximal power for each prefix of a string (e.g. 'ababab' = 'ab'^3)

5. Aho-Corasick Algorithm - a generalized version of KMP algorithm

6. One typical application of AC Alg.: 1-ва задача от 1-ва контрола за 2002 на Националния отбор по информатика

7. One interesting application of AC Alg.: задача PIC от Междууниверситетския турнир по програмиране 2002

Заб. Лекцията ще бъде на български език.