Approximate Regular Expressions and Their Derivatives

  • Jean-Marc Champarnaud
  • Hadrien Jeanne
  • Ludovic Mignot
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7183)


Several studies have been achieved to construct a finite automaton that recognizes the set of words that are at a bounded distance from some word of a given language. In this paper, we introduce a new family of regular operators based on a generalization of the notion of distance and we define a new family of expressions, the approximate regular expressions. We compute Brzozowski derivatives and Antimirov derivatives of such operators, which allows us to provide two recognizers for the language denoted by any approximate regular expression.


Cost Function Comparison Function Regular Expression Regular Language Regular Operator 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Antimirov, V.: Partial derivatives of regular expressions and finite automaton constructions. Theoret. Comput. Sci. 155, 291–319 (1996)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Brzozowski, J.A.: Derivatives of regular expressions. J. Assoc. Comput. Mach. 11(4), 481–494 (1964)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Caron, P., Champarnaud, J.-M., Mignot, L.: Partial Derivatives of an Extended Regular Expression. In: Dediu, A.-H., Inenaga, S., Martín-Vide, C. (eds.) LATA 2011. LNCS, vol. 6638, pp. 179–191. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  4. 4.
    Crochemore, M., Lecroq, T.: Text searching and indexing. In: Recent Advances in Formal Languages and Applications. SCI, vol. 25, pp. 43–80. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  5. 5.
    El-Mabrouk, N.: Recherche approchée de motifs - Application à des séquences biologiques structurées. Ph.D. thesis, LITP, Université Paris 7, France (1996)Google Scholar
  6. 6.
    Holub, J.: Dynamic Programming - NFA Simulation. In: Champarnaud, J.-M., Maurel, D. (eds.) CIAA 2002. LNCS, vol. 2608, pp. 295–300. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  7. 7.
    Jokinen, P., Tarhio, J., Ukkonen, E.: A comparison of approximate string matching algorithms. Softw., Pract. Exper. 26(12), 1439–1458 (1996)CrossRefGoogle Scholar
  8. 8.
    Kleene, S.: Representation of events in nerve nets and finite automata. Automata Studies Ann. Math. Studies 34, 3–41 (1956)MathSciNetGoogle Scholar
  9. 9.
    Muzátko, P.: Approximate regular expression matching. In: Stringology, pp. 37–41. Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University (1996)Google Scholar
  10. 10.
    Myers, E., Miller, W.: Approximate matching of regular expressions. Bulletin of Mathematical Biology 51, 5–37 (1989),, doi:10.1007/BF02458834MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Myhill, J.: Finite automata and the representation of events. WADD TR-57-624, 112–137 (1957)Google Scholar
  12. 12.
    Navarro, G.: A guided tour to approximate string matching. ACM Computing Surveys 33(1), 31–88 (2001)CrossRefGoogle Scholar
  13. 13.
    Navarro, G.: Approximate regular expression matching. In: Kao, M.-Y. (ed.) Encyclopedia of Algorithms, pp. 46–48. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  14. 14.
    Nerode, A.: Linear automata transformation. Proceedings of AMS 9, 541–544 (1958)Google Scholar
  15. 15.
    Schulz, K.U., Mihov, S.: Fast string correction with levenshtein automata. IJDAR 5(1), 67–85 (2002)CrossRefzbMATHGoogle Scholar
  16. 16.
    Ukkonen, E., Wood, D.: Approximate string matching with suffix automata. Algorithmica 10, 353–364 (1993),, doi:10.1007/BF01769703MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Jean-Marc Champarnaud
    • 1
  • Hadrien Jeanne
    • 1
  • Ludovic Mignot
    • 1
  1. 1.LITISUniversité de RouenSaint-Étienne du Rouvray CedexFrance

Personalised recommendations