Porovnávání vzorů s využitím suffixových automatů

Abstract

This thesis is about suffix automata. In the beginning of work, I choose some suffix automata. This automata describe and program. I get input data and do tests. This tests created on base criteria important for final application. I do testing every algorithms. I analyze this tests. On the results I adapt final version of program. Final program will be searching patterns in text.