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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Antimirov, V.: Partial derivatives of regular expressions and finite automaton constructions. Theoret. Comput. Sci. 155, 291–319 (1996)
Brzozowski, J.A.: Derivatives of regular expressions. J. Assoc. Comput. Mach. 11(4), 481–494 (1964)
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)
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)
El-Mabrouk, N.: Recherche approchée de motifs - Application à des séquences biologiques structurées. Ph.D. thesis, LITP, Université Paris 7, France (1996)
Holub, J.: Dynamic Programming - NFA Simulation. In: Champarnaud, J.-M., Maurel, D. (eds.) CIAA 2002. LNCS, vol. 2608, pp. 295–300. Springer, Heidelberg (2003)
Jokinen, P., Tarhio, J., Ukkonen, E.: A comparison of approximate string matching algorithms. Softw., Pract. Exper. 26(12), 1439–1458 (1996)
Kleene, S.: Representation of events in nerve nets and finite automata. Automata Studies Ann. Math. Studies 34, 3–41 (1956)
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)
Myers, E., Miller, W.: Approximate matching of regular expressions. Bulletin of Mathematical Biology 51, 5–37 (1989), http://dx.doi.org/10.1007/BF02458834 , doi:10.1007/BF02458834
Myhill, J.: Finite automata and the representation of events. WADD TR-57-624, 112–137 (1957)
Navarro, G.: A guided tour to approximate string matching. ACM Computing Surveys 33(1), 31–88 (2001)
Navarro, G.: Approximate regular expression matching. In: Kao, M.-Y. (ed.) Encyclopedia of Algorithms, pp. 46–48. Springer, Heidelberg (2008)
Nerode, A.: Linear automata transformation. Proceedings of AMS 9, 541–544 (1958)
Schulz, K.U., Mihov, S.: Fast string correction with levenshtein automata. IJDAR 5(1), 67–85 (2002)
Ukkonen, E., Wood, D.: Approximate string matching with suffix automata. Algorithmica 10, 353–364 (1993), http://dx.doi.org/10.1007/BF01769703 , doi:10.1007/BF01769703
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Champarnaud, JM., Jeanne, H., Mignot, L. (2012). Approximate Regular Expressions and Their Derivatives. In: Dediu, AH., Martín-Vide, C. (eds) Language and Automata Theory and Applications. LATA 2012. Lecture Notes in Computer Science, vol 7183. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28332-1_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-28332-1_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28331-4
Online ISBN: 978-3-642-28332-1
eBook Packages: Computer ScienceComputer Science (R0)