Approximate Periods with Levenshtein Distance
- Cite this paper as:
- Šimůnek M., Melichar B. (2008) Approximate Periods with Levenshtein Distance. In: Ibarra O.H., Ravikumar B. (eds) Implementation and Applications of Automata. CIAA 2008. Lecture Notes in Computer Science, vol 5148. Springer, Berlin, Heidelberg
We present a new algorithm deciding for strings t and w whether w is an approximate generator of t with Levenshtein distance at most k. The algorithm is based on finite state transducers.