Approximate regular expressions and their derivatives

Authors:
Jean-Marc Champarnaud;Hadrien Jeanne;Ludovic Mignot
Affiliations:
LITIS, Université de Rouen, Saint-Étienne du Rouvray Cedex, France;LITIS, Université de Rouen, Saint-Étienne du Rouvray Cedex, France;LITIS, Université de Rouen, Saint-Étienne du Rouvray Cedex, France
Venue:
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Year:
2012

Citing 6
Cited 1

Partial derivatives of regular expressions and finite automaton constructions

Theoretical Computer Science
A comparison of approximate string matching algorithms

Software—Practice & Experience
Derivatives of Regular Expressions

Journal of the ACM (JACM)
A guided tour to approximate string matching

ACM Computing Surveys (CSUR)
Dynamic programming: NFA simulation

CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Partial derivatives of an extended regular expression

LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications

Multi-tilde-bar derivatives

CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.