V. Antimirov, Partial derivatives of regular expressions and finite automaton constructions, Theoretical Computer Science, vol.155, issue.2, pp.291-319, 1996.
DOI : 10.1016/0304-3975(95)00182-4

R. A. Baeza-yates and G. H. Gonnet, Fast text searching for regular expressions or automaton searching on tries, Journal of the ACM, vol.43, issue.6, pp.915-936, 1996.
DOI : 10.1145/235809.235810

J. A. Brzozowski, Derivatives of Regular Expressions, Journal of the ACM, vol.11, issue.4, pp.481-494, 1964.
DOI : 10.1145/321239.321249

P. Caron, J. Champarnaud, and L. Mignot, Partial Derivatives of an Extended Regular Expression, Lecture Notes in Computer Science, vol.6638, pp.179-191, 2011.
DOI : 10.1007/978-3-642-21254-3_13

J. Champarnaud, H. Jeanne, and L. Mignot, Approximate Regular Expressions and Their Derivatives, LATA, pp.179-191, 2012.
DOI : 10.1007/978-3-642-28332-1_16

M. Crochemore and T. Lecroq, Text searching and indexing, Recent Advances in Formal Languages and Applications, pp.43-80, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00470108

J. Holub, Dynamic Programming ??? NFA Simulation, CIAA, pp.295-300, 2002.
DOI : 10.1007/3-540-44977-9_32

P. Jokinen, J. Tarhio, and E. Ukkonen, A Comparison of Approximate String Matching Algorithms, Software: Practice and Experience, vol.26, issue.12, pp.1439-1458, 1996.
DOI : 10.1002/(SICI)1097-024X(199612)26:12<1439::AID-SPE71>3.0.CO;2-1

S. Kleene, Representation of Events in Nerve Nets and Finite Automata, Automata Studies, Ann. Math. Studies, vol.34, pp.3-41, 1956.
DOI : 10.1515/9781400882618-002

P. Muzátko, Approximate regular expression matching, Stringology, pp.37-41, 1996.

E. Myers and W. Miller, Approximate matching of regular expressions, Bulletin of Mathematical Biology, vol.20, issue.1, pp.5-37, 1989.
DOI : 10.1007/BF02458834

J. Myhill, Finite automata and the representation of events. WADD, TR-57-624, pp.112-137, 1957.

G. Navarro, A guided tour to approximate string matching, ACM Computing Surveys, vol.33, issue.1, pp.31-88, 2001.
DOI : 10.1145/375360.375365

G. Navarro, Approximate regular expression matching, Encyclopedia of Algorithms, pp.46-48, 2008.
DOI : 10.1007/978-0-387-30162-4_22

A. Nerode, Linear automata transformation, Proceedings of AMS 9, pp.541-544, 1958.

K. U. Schulz and S. Mihov, Fast string correction with Levenshtein automata, International Journal on Document Analysis and Recognition, vol.5, issue.1, pp.67-85, 2002.
DOI : 10.1007/s10032-002-0082-8

E. Ukkonen and D. Wood, Approximate string matching with suffix automata, Algorithmica, vol.21, issue.5, pp.353-364, 1993.
DOI : 10.1007/BF01769703

S. Wu, U. Manber, and E. W. Myers, A Subquadratic Algorithm for Approximate Regular Expression Matching, Journal of Algorithms, vol.19, issue.3, pp.346-360, 1995.
DOI : 10.1006/jagm.1995.1041