Approximate Regular Expressions and Their Derivatives
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.
KeywordsCost Function Comparison Function Regular Expression Regular Language Regular Operator
Unable to display preview. Download preview PDF.
- 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
- 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
- 11.Myhill, J.: Finite automata and the representation of events. WADD TR-57-624, 112–137 (1957)Google Scholar
- 14.Nerode, A.: Linear automata transformation. Proceedings of AMS 9, 541–544 (1958)Google Scholar