Jean Berstel

Jean Berstel
Laboratoire d'Informatique Gaspard-Monge (LIGM),
Université Paris-Est Marne-la-Vallée
5 Bd Descartes, Champs-sur-Marne
F-77454 Marne-la-Vallée CEDEX 2, France
Tél: 00-33-1-60-95-75-64
e-mail: berstel[at]univ-mlv.fr

Personnel

Statistique Google Scolar:

Exercices:

Eilenberg:

In preparation:

Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot. Minimization of Automata, to appear in the Handbook of Automata.
Marie-Pierre Béal, Jean Berstel, Søren Eilers, Dominique Perrin. Symbolic Dynamics, to appear in the Handbook of Automata.

Books and book chapters:

Jean Berstel, Christophe Reutenauer Noncommutative Rational Series With Applications, Encyclopedia of Mathematics and its Applications No. 137, Cambridge University Press, october 2010.
Marie-Pierre Béal, Jean Berstel, Brian H. Marcus, Dominique Perrin, Christophe Reutenauer, Paul H. Siegel Variable-length codes and finite automata , in I. Woungang, S. Misra, S. C. Misra (eds), Selected Topics in Information and Coding Theory, World Scientific, 2010. Here are also slides.

Reprints of old papers:

Jean Berstel, Luc Boasson. Towards an algebraic theory of context-free languages. Fundamenta Informaticae, 25(3):217-239, 1996.
Jean Berstel, Axel Thue's papers on repetitions in words: a translation, Publications du LaCIM, Département de mathématiques et d'informatique 20, Université du Québec à Montréal, 1995, 85 pages.
Jean Berstel, Luc Boasson, Context-Free Languages, in: J. van Leewen (ed.), Handbook of Theoretical Computer Science Vol. B, Elsevier, 1990, 59--102.
Jean-Michel Autebert, Jean Berstel, Luc Boasson, Context-Free Languages and Push-Down Automata, in: G. Rozenberg, A. Salomaa (eds.), Handbook of Formal Languages, Vol. 1, Springer-Verlag, 1997, 111-174.