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. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Champarnaud, J. M., Jeanne, H., & Mignot, L. (2012). Approximate regular expressions and their derivatives. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7183 LNCS, pp. 179–191). https://doi.org/10.1007/978-3-642-28332-1_16
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
