Géraud Sénizergues Explained

Fields:	Computer science
Workplaces:	University of Bordeaux
Nationality:	French
Birth Date:	9 March 1957

Géraud Sénizergues (born 9 March 1957) is a French computer scientist at the University of Bordeaux.

He is known for his contributions to automata theory, combinatorial group theory and abstract rewriting systems.^[1]

He received his Ph.D. (Doctorat d'état en Informatique) from the Université Paris Diderot (Paris 7) in 1987 under the direction of Jean-Michel Autebert.^[2]

With Yuri Matiyasevich he obtained results about the Post correspondence problem.^[3] He won the 2002 Gödel Prize "for proving that equivalence of deterministic pushdown automata is decidable".^{[4] [5] [6]} In 2003 he was awarded with the Gay-Lussac Humboldt Prize.

External links

• Homepage

Notes and References

1. Web site: DBLP Geraud Senizergues.
2. Web site: Mathematical Genealogy Project, Geraud Senizergues.
3. Book: Matiyasevich. Y.. Senizergues. G.. Proceedings 11th Annual IEEE Symposium on Logic in Computer Science . Decision problems for semi-Thue systems with a few rules . 1996. New Brunswick, NJ, USA. IEEE Comput. Soc. Press. 523–531. 10.1109/LICS.1996.561469. 9780818674631. 14296200 .
4. Web site: 2002 Gödel Prize. sigact.org. 2019-05-10.
5. Sénizergues. Géraud. 1997. Degano. Pierpaolo. Gorrieri. Roberto. Marchetti-Spaccamela. Alberto. The equivalence problem for deterministic pushdown automata is decidable. Automata, Languages and Programming. 1256. Lecture Notes in Computer Science. en. Springer Berlin Heidelberg. 671–681. 10.1007/3-540-63165-8_221. 9783540691945.
6. Sénizergues. Géraud. 2001. L(A)=L(B)? decidability results from complete formal systems. Theoretical Computer Science. 251. 1–2. 1–166. 10.1016/S0304-3975(00)00285-1. free.