Géraud Sénizergues | |
---|---|
Born | 9 March 1957 |
Nationality | French |
Awards |
|
Scientific career | |
Fields | Computer science |
Institutions | University of Bordeaux |
Website |
dept-info |
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.
Géraud Sénizergues | |
---|---|
Born | 9 March 1957 |
Nationality | French |
Awards |
|
Scientific career | |
Fields | Computer science |
Institutions | University of Bordeaux |
Website |
dept-info |
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.