Jump to content

Dominique Perrin

From Wikipedia, the free encyclopedia
Dominique Perrin
Dominique Perrin
Born (1946-11-05) November 5, 1946 (age 78)
Alma materParis Diderot University
Known forcombinatorics on words
coding theory
Scientific career
FieldsFormal language theory
Combinatorics on words
InstitutionsUniversity of Marne-la-Vallée
Doctoral advisorMarcel-Paul Schützenberger
Doctoral students

Dominique Pierre Perrin[1] (b. 1946) is a French mathematician and theoretical computer scientist known for his contributions to coding theory and to combinatorics on words. He is a professor of the University of Marne-la-Vallée and currently serves as the President of ESIEE Paris.

Biography

[edit]

Perrin earned his PhD from Paris 7 University in 1975. In his early career, he was a CNRS researcher (1970–1977) and taught at the University of Chile (1972–1973). Later, he worked as a professor at the University of Rouen (1977–1983), Paris 7 University (1983–1993), and École Polytechnique (1982–2002). Since 1993, Perrin is a professor at the University of Marne-la-Vallée, and since 2004, he is the President of ESIEE Paris.

Perrin is a member of Academia Europaea since 1989.

Scientific contributions

[edit]

Perrin has been a member of the Lothaire group of mathematicians that developed the foundations of combinatorics on words. He has co-authored three scientific monographs: "Theory of Codes" (1985),[2] "Codes and Automata" (2009),[3] and "Infinite Words" (2004),[4] as well as the three Lothaire books.[5][6][7] Perrin has published around 50 research articles in formal language theory.

References

[edit]
  1. ^ "Dominique PERRIN: Biographie et actualités sur EducPros".
  2. ^ Berstel, Jean; Perrin, Dominique (1985). Theory of Codes. Pure and Applied Mathematics. Vol. 117. Academic Press. ISBN 978-0-120-93420-1.
  3. ^ 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.
  4. ^ Perrin, Dominique; Pin, Jean-Éric (2004). Infinite Words: Automata, Semigroups, Logic and Games. Pure and Applied Mathematics. Vol. 141. Academic Press. ISBN 978-0-125-32111-2.
  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. doi:10.1017/CBO9781107326019. 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. doi:10.1017/CBO9781107341005. ISBN 978-0-521-84802-2. MR 2165687.
[edit]