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

Recent papers:

Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot. Sturmian trees, Theory of Computing Systems, selected papers from STACS 2007, 46(3): 443-478, 2010.
Jean Berstel, Luc Boasson, Olivier Carton. Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm Theoret. Comput. Sci. 410(30-32), 2811-2822, 2009.
Jean Berstel, Christophe Reutenauer, Extension of Brzozowski's derivation calculus of rational expressions to series over the free partially commutative monoids, Theoret. Comput. Sci. 400 144-158, 2008.

Surveys, books and book chapters:

Jean Berstel, Dominique Perrin, Christophe Reutenauer Codes and Automata,Encyclopedia of Mathematics and its Applications No. 129, Cambridge University Press, november 2009.
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 (ed), Selected Topics in Information and Coding Theory, World Scientific, to appear. Here are also slides.
Jean Berstel, Aaron Lauve, Christophe Reutenauer, Franco Saliola, Combinatorics on Words: Christoffel Words and Repetition in Words , CRM monograph series 27, Université de Montréal and American Mathematical Society, (2008), 147 pages.

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.