M. Ackerman and E. Mäkinen, Three New Algorithms for Regular Language Enumeration, COCOON, vol.5609, pp.178-191, 2009.

M. Ackerman and J. Shallit, Efficient Enumeration of Words in Regular Languages, Theor. Comput. Sci, vol.410, pp.3461-3470, 2009.

M. Valentin and . Antimirov, Partial derivatives of regular expressions and finite automaton constructions, Theoretical Computer Science, vol.155, pp.291-319, 1996.

A. Janusz and . Brzozowski, Derivatives of Regular Expressions, J. ACM, vol.11, pp.481-494, 1964.

K. Claessen and J. Hughes, QuickCheck: a lightweight tool for random testing of Haskell programs, Proceedings of the Fifth ACM SIGPLAN International Conference on Functional Programming (ICFP '00), pp.268-279, 2000.

R. Cox, Implementing Regular Expressions, 2007.

R. Cox, Regular Expression Matching in the Wild, 2010.

S. Dolan and M. Preston, Testing with Crowbar, 2017.

S. Fischer, F. Huch, and T. Wilke, A play on regular expressions: functional pearl, Proceeding of the 15th ACM SIGPLAN international conference on Functional programming, ICFP 2010, pp.357-368, 2010.

E. Fredkin, Trie Memory, vol.3, pp.490-499, 1960.

B. Groz and S. Maneth, Efficient testing and matching of deterministic regular expressions, J. Comput. Syst. Sci, vol.89, pp.372-399, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01615021

J. E. Hopcroft, R. Motwani, and J. D. Ullman, Introduction to automata theory, languages, and computation-international edition, 2003.

R. Lämmel, Grammar Testing, Fundamental Approaches to Software Engineering, 4th International Conference, FASE 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, vol.2029, pp.201-216, 2001.

H. Li, M. Jin, C. Liu, and Z. Gao, Test Criteria for Context-Free Grammars, 28th International Computer Software and Applications Conference, pp.300-305, 2004.

. Erkki-mäkinen, On Lexicographic Enumeration of Regular and Context-Free Languages, Acta Cybern, vol.13, pp.55-61, 1997.

M. D. Mcilroy, Enumerating the Strings of Regular Languages, J. Funct. Program, vol.14, pp.503-518, 2004.

J. Misra, Enumerating the Strings of a Regular Expression, 2000.

M. S. New, B. Fetscher, R. B. Findler, and J. A. Mccarthy, Fair enumeration combinators. J. Funct. Program, vol.27, 2017.

C. Okasaki and A. Gill, Fast Mergeable Integer Maps, Workshop on ML, pp.77-86, 1998.

A. M. Paracha and F. Franek, Testing Grammars For TopDown Parsers, I of the proceedings of the 2008 International Conference on Systems, Computing Sciences and Software Engineering (SCSS), part of the International Joint Conferences on Computer, Information, and Systems Sciences, and Engineering, pp.451-456, 2008.

F. Pottier, Verifying a Hash Table and its Iterators in HigherOrder Separation Logic, Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs, pp.3-16, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01417102

P. Purdom, A Sentence Generator for Testing Parsers, BIT, vol.12, pp.366-375, 1972.

. Regexlib, Regular Expression Library

K. Thompson, Regular Expression Search Algorithm, Commun. ACM, vol.11, pp.419-422, 1968.

J. S. Vitter, An efficient algorithm for sequential random sampling, ACM Trans. Math. Softw, vol.13, pp.58-67, 1987.
URL : https://hal.archives-ouvertes.fr/inria-00075929

M. Zalewski, A Sentence Generation Algorithm for Testing Grammars, Proceedings of the 33rd Annual IEEE International Computer Software and Applications Conference, vol.1, pp.130-135, 2009.