Approximate Periods with Levenshtein Distance

  • Martin Šimůnek
  • Bořivoj Melichar
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5148)

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.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Martin Šimůnek
    • 1
  • Bořivoj Melichar
    • 1
  1. 1.Department of Computer Science and EngineeringCzech Technical University in PragueCzech Republic

Personalised recommendations