Approximate Periods with Levenshtein Distance ⋆

Abstract. 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.