Géraud Sénizergues
French computer scientist
From Wikipedia, the free encyclopedia
Géraud Sénizergues (born 9 March 1957) is a French computer scientist at the University of Bordeaux.
Born9 March 1957
Awards
- Gödel Prize (2002)
- Gay-Lussac Humboldt Prize (2003)
FieldsComputer science
InstitutionsUniversity of Bordeaux
Géraud Sénizergues | |
|---|---|
Sénizergues in September 2017 | |
| Born | 9 March 1957 |
| Awards |
|
| Scientific career | |
| Fields | Computer science |
| Institutions | University of Bordeaux |
| Website | dept-info |
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.
