Jump to content

Jean Berstel

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Uzume (talk | contribs) at 14:31, 27 March 2017 (→‎External links). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Jean Berstel
Born1941 (age 82–83)
Alma materParis Diderot University
Scientific career
FieldsCombinatorics on words
Formal language theory
InstitutionsUniversity of Marne-la-Vallée
Pierre and Marie Curie University
Doctoral advisorMarcel-Paul Schützenberger

Jean Berstel (born 1941) is a French mathematician and theoretical computer scientist known for his contributions to combinatorics on words and formal language theory. He is a currently a professor emeritus at the University of Marne-la-Vallée.

Biography

Berstel earned his doctorate (doctorat d'État) at the Paris Diderot University in 1973. In 1973--1995 he was a professor at Pierre and Marie Curie University, and in 1995--2005 a professor at the University of Marne-la-Vallée, where he is a professor emeritus since 2005.

In 2006, Berstel was awarded an honorary doctorate from the University of Turku, Finland. A festschrift in his honour was published in 2003 as a special issue of Theoretical Computer Science.[1]

Research contributions

Berstel has been a member of the Lothaire group of mathematicians that developed the foundations of combinatorics of words. He has published several scientific monographs, including "Transductions and Context-free Languages" (1979),[2] "Theory of Codes" (1985, jointly with Dominique Perrin),[3] and "Codes and Automata" (2009; jointly with Dominique Perrin and Christophe Reutenauer)[4] as well as the three Lothaire books.[5][6][7]

References

  1. ^ Séébold, Patrice (2003). "Foreword". Theoretical Computer Science. 292 (1): 1. doi:10.1016/S0304-3975(01)00210-9. ISSN 0304-3975.
  2. ^ Berstel, Jean (1979). Transductions and Context-free Languages. Treubner Verlag. doi:10.1007/978-3-663-09367-1. ISBN 978-3-519-02340-1.
  3. ^ Berstel, Jean; Perrin, Dominique (1985). Theory of Codes. Pure and Applied Mathematics. Vol. 117. Academic Press. ISBN 978-0-120-93420-1.
  4. ^ Berstel, Jean; Perrin, Dominique; Reutenauer, Christophe (2009). Codes and Automata. Encyclopedia of Mathematics and its Applications. Vol. 129. Cambridge University Press. ISBN 978-0-521-88831-8.
  5. ^ Lothaire, M. (1983). Combinatorics on Words. Encyclopedia of Mathematics and its Applications. Vol. 17. Addison-Wesley Publishing Co., Reading, Mass. doi:10.1017/CBO9780511566097. ISBN 978-0-201-13516-9. MR 0675953.
  6. ^ Lothaire, M. (2002). Algebraic Combinatorics on Words. Encyclopedia of Mathematics and its Applications. Vol. 90. Cambridge University Press. ISBN 978-0-521-81220-7. MR 1905123.
  7. ^ Lothaire, M. (2005). Applied Combinatorics on Words. Encyclopedia of Mathematics and its Applications. Vol. 105. Cambridge University Press. ISBN 978-0-521-84802-2. MR 2165687.

External links