M. Valentin, P. D. Antimirov, and . Mosses, Rewriting extended regular expressions, Theoretical Computer Science, vol.143, issue.1, pp.51-72, 1995.

C. Allauzen and M. Mohri, A Unified Construction of the Glushkov, Follow, and Antimirov Automata, pp.110-121, 2006.
DOI : 10.1007/11821069_10

M. Almeida, N. Moreira, and R. Reis, Antimirov and Mosses's rewrite system revisited, CIAA 2008 : Thirteenth International Conference on Implementation and Application of Automata, number 5448 in LNCS, pp.46-56, 2008.

M. Almeida, N. Moreira, and R. Reis, Antimirov and Mosses's rewrite system revisited, International Journal of Foundations of Computer Science, 2009.

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

Y. Bertot and P. Castéran, Interactive Theorem Proving and Program Development , Coq'Art :the Calculus of Inductive Constructions, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00344237

A. Brüggemann-klein, Regular expressions into finite automata, Theoretical Computer Science, vol.120, issue.2, pp.197-213, 1993.
DOI : 10.1016/0304-3975(93)90287-4

T. Braibant and D. Pous, A tactic for deciding Kleene algebras, Proceedings of the first Coq Workshop, 2009.

J. Berstel and C. Reutenauer, Rational series and their languages, Eatcs Monographs On Theoretical Computer Science, 1988.
DOI : 10.1007/978-3-642-73235-5

URL : https://hal.archives-ouvertes.fr/hal-00619791

A. Januz and . Brzozowski, Derivatives of regular expressions, Journal of the Association for Computing Machinery, vol.11, issue.4, pp.481-494, 1964.

[. Berry and R. Sethi, From regular expressions to deterministic automata, Theoretical Computer Science, vol.48, issue.1, pp.117-126, 1986.
DOI : 10.1016/0304-3975(86)90088-5

URL : https://hal.archives-ouvertes.fr/inria-00075904

J. Champarnaud, E. Laugerotte, F. Ouardi, and D. Ziadi, FROM REGULAR WEIGHTED EXPRESSIONS TO FINITE AUTOMATA, International Journal of Foundations of Computer Science, vol.15, issue.05, pp.687-700, 2004.
DOI : 10.1142/S0129054104002698

[. Coutts, R. Leshchinskiy, and D. Stewart, Stream fusion : From lists to streams to nothing at all, Proceedings of the ACM SIGPLAN International Conference on Functional Programming, 2007.

J. Champarnaud, F. Nicart, and D. Ziadi, FROM THE $\mathcal{ZPC}$ STRUCTURE OF A REGULAR EXPRESSION TO ITS FOLLOW AUTOMATON, International Journal of Algebra and Computation, vol.16, issue.01, pp.17-34, 2006.
DOI : 10.1142/S0218196706002895

J. Horton and C. , Regular Algebra and Finite Machines, 1971.

J. Champarnaud, F. Ouardi, D. Chomsky, and M. Schützenberger, The algebraic theory of contextfree languages Computer Programming and Formal Systems [CZ01] Jean-Marc Champarnaud and Djelloul Ziadi. From c-continuations to new quadratic algorithms for automaton synthesis Canonical derivatives, partial derivatives and finite automaton constructions, DM79] Nachum Dershowitz and Zohar Manna. Proving termination with multiset orderings, pp.141-154, 1963.

I. Dolinka, The multiplicative fragment of the Yanov equational theory, Camlp4 -Reference manual. Available on the WebEil74] Samuel Eilenberg. Automata, languages, and machines Proceedings of the ACM SIGPLAN Workshop on ML 2006, pp.417-4251, 1961.
DOI : 10.1016/S0304-3975(02)00887-3

M. Gross, Notes sur l'histoire de la traduction automatique, Langages, vol.7, issue.28, pp.40-48, 1972.
DOI : 10.3406/lgge.1972.2096

G. Huet and B. Razet, The reactive engine for modular transducers Algebra, Meaning and Computation, Essays Dedicated to Joseph A. Goguen on the Occasion of His 65th Birthday, pp.355-374, 2006.

G. Huet, The Zen computational linguistics toolkit. ESSLLI, Lectures, 2002.

G. Huet, A functional toolkit for morphological and phonological processing, application to a Sanskrit tagger, Journal of Functional Programming, vol.15, issue.4, 2005.
DOI : 10.1017/S0956796804005416

URL : https://hal.archives-ouvertes.fr/hal-00424306

L. Ilie and S. Yu, Follow automata, Information and Computation, vol.186, issue.1, pp.140-162, 2003.
DOI : 10.1016/S0890-5401(03)00090-7

L. Karttunen, Applications of Finite-State Transducers in Natural Language Processing, Proceedings, CIAA-2000, 2000.
DOI : 10.1007/3-540-44674-5_2

M. Ronald, M. Kaplan, and . Kay, Regular models of phonological rule systems Representation of events in nerve nets and finite automata, Computational Linguistics Automata Studies, Annals of Mathematics Studies, vol.203, issue.36, pp.331-378, 1956.

D. Kozen, On kleene algebras and closed semirings, Proc. Math, pp.26-47, 1990.
DOI : 10.1007/BFb0029594

D. Kozen, A completeness theorem for Kleene algebras and the algebra of regular events, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science, pp.366-390, 1994.
DOI : 10.1109/LICS.1991.151646

D. Kozen, Typed Kleene algebra, 1998.

X. Leroy, D. Doligez, J. Garrigue, and J. Vouillon, The Objective Caml system. Software and documentation available on the Web, 1996.

[. Lombardy and J. Sakarovitch, Derivatives of rational expressions with multiplicity, Theoretical Computer Science, vol.332, issue.1-3, pp.141-177, 2005.
DOI : 10.1016/j.tcs.2004.10.016

URL : https://hal.archives-ouvertes.fr/hal-00017202

]. B. Mir66 and . Mirkin, An algorithm for constructing a base in a language of regular expressions . Engineering cybernetics, pp.110-116, 1966.

M. Mohri, Finite-state transducers in language and speech processing, Computational Linguistics, vol.232, pp.269-311, 1997.

H. [. Mcnaughton and . 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

S. Owens, J. Reppy, and A. Turon, Regular-expression derivatives re-examined, Journal of Functional Programming, vol.9, issue.02, pp.173-190, 2009.
DOI : 10.1017/S0956796801004208

V. Pratt, Action logic and pure induction, Logics in AI : European Workshop JELIA '90, pp.97-120, 1990.
DOI : 10.1007/BFb0018436

R. Paige and R. E. Tarjan, Three Partition Refinement Algorithms, SIAM Journal on Computing, vol.16, issue.6, 1987.
DOI : 10.1137/0216062

A. Ranta, Grammatical Framework, Journal of Functional Programming, vol.14, issue.2, pp.145-189, 2004.
DOI : 10.1017/S0956796803004738

P. Raymond, Recognizing regular expressions by means of dataflow networks, 23rd International Colloquium on Automata, Languages, and Programming, 1996.
DOI : 10.1007/3-540-61440-0_140

URL : https://hal.archives-ouvertes.fr/hal-00384443

B. Razet, Finite Eilenberg Machines, 13th International Conference on Implementation and Application of Automata, pp.242-251, 2008.
DOI : 10.1007/978-3-540-70844-5_25

URL : https://hal.archives-ouvertes.fr/inria-00257354

B. Razet, Simulating Finite Eilenberg Machines with a Reactive Engine, Mathematically Structured Functional Programming, 2008.
DOI : 10.1016/j.entcs.2011.02.019

]. V. Red64 and . Redko, On defining relations for the algebra of regular events, Ukrain. Mat, vol.16, pp.120-126, 1964.

H. Rogers, Theory of Recursive Functions and Effective Computability, 1967.

M. Rabin and D. Scott, Finite Automata and Their Decision Problems, IBM Journal of Research and Development, vol.3, issue.2, pp.114-125, 1959.
DOI : 10.1147/rd.32.0114

E. Roche and Y. Schabes, Deterministic part-of-speech tagging with finitestate transducers, Computational Linguistics, vol.212, pp.227-253, 1995.

Y. Roche and . Schabes, Finite-state language processing, 1997.

A. Salomaa, Two Complete Axiom Systems for the Algebra of Regular Events, Journal of the ACM, vol.13, issue.1, pp.158-169, 1966.
DOI : 10.1145/321312.321326

J. Saraiva, HaLeX : A Haskell library to model, manipulate and animate regular languages, Proceedings of the ACM Workshop on Functional and Declarative Programming in Education (FDPE/PLI'02), 2002.

[. Schützenberger, On the definition of a family of automata, Information and Control, vol.4, issue.2-3, pp.245-270, 1961.
DOI : 10.1016/S0019-9958(61)80020-X

[. Sproat, Morphology and Computation, 1992.

[. Sippu and E. Soisalon-soininen, Parsing theory : languages and parsing, EATCS Monographs on Theoretical Computer Science, vol.1, issue.15, 1988.

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

S. Thompson, Regular expressions and automata using Haskell, 2000.

. I. Ju and . Yanov, On identical transformations of regular expressions, Dokl. Akad. Nauk SSSR, vol.147, pp.327-330, 1962.

[. Zhang and L. Smith, A collection of functional libraries for theory of computation, Proceedings of the 39th ACM-SE Conference, pp.83-90, 2001.