Approximate Periods with Levenshtein Distance

  • Martin Šimůnek
  • Bořivoj Melichar
Conference paper

DOI: 10.1007/978-3-540-70844-5_30

Volume 5148 of the book series Lecture Notes in Computer Science (LNCS)
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

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