A. V. Aho, Algorithms for finding patterns in strings Handbook of theoretical computer science, pp.257-300, 1990.

V. Antimirov, Partial derivatives of regular expressions and finite automata constructions, Proceedings of STACS '95, pp.455-466, 1995.
DOI : 10.1007/3-540-59042-0_96

G. Berry and R. Sethi, From regular expressions to deterministic automata, Theoretical Computer Science, vol.48, pp.117-126, 1986.
DOI : 10.1016/0304-3975(86)90088-5
URL : https://hal.archives-ouvertes.fr/inria-00075904

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

J. A. Brzozowski and E. Leiss, On equations for regular languages, finite automata, and sequential networks, Theoretical Computer Science, vol.10, issue.1, pp.19-35, 1980.
DOI : 10.1016/0304-3975(80)90069-9

C. H. Chang and R. Paige, From regular expressions to DFA's using compressed NFA's, Combinatorial Pattern Matching. Proceedings, pp.88-108, 1992.
DOI : 10.1007/3-540-56024-6_8

R. W. Floyd and J. D. Ullman, The Compilation of Regular Expressions into Integrated Circuits, Journal of the ACM, vol.29, issue.3, pp.603-622, 1982.
DOI : 10.1145/322326.322327

N. Halbwachs, Synchronous programming of reactive systems, Kluwer Academic Pub, 1993.

N. Halbwachs, F. Lagnier, and P. Raymond, Synchronous Observers and the Verification of Reactive Systems, Third Int. Conf. on Algebraic Methodology and Software Technology, AMAST'93 Workshops in Computing, 1993.
DOI : 10.1007/978-1-4471-3227-1_8

R. Mcnaughton and H. Yamada, Regular Expressions and State Graphs for Automata, IEEE Transactions on Electronic Computers, vol.9, issue.1, pp.39-47, 1960.
DOI : 10.1109/TEC.1960.5221603

K. Thompson, Programming Techniques: Regular expression search algorithm, Communications of the ACM, vol.11, issue.6, pp.419-423, 1968.
DOI : 10.1145/363347.363387