| Géraud Sénizergues | |
|---|---|
 Sénizergues in September 2017 | |
| Born | (1957-03-09) 9 March 1957 (age 67) |
| 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.
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.
With Yuri Matiyasevich he obtained results about the Post correspondence problem. He won the 2002 Gödel Prize "for proving that equivalence of deterministic pushdown automata is decidable". In 2003 he was awarded with the Gay-Lussac Humboldt Prize.
References
- "DBLP Geraud Senizergues".
- "Mathematical Genealogy Project, Geraud Senizergues".
- Matiyasevich, Y.; Senizergues, G. (1996). "Decision problems for semi-Thue systems with a few rules". Proceedings 11th Annual IEEE Symposium on Logic in Computer Science. New Brunswick, NJ, USA: IEEE Comput. Soc. Press. pp. 523–531. doi:10.1109/LICS.1996.561469. ISBN 9780818674631. S2CID 14296200.
- "2002 Gödel Prize". sigact.org. Retrieved 2019-05-10.
- Sénizergues, Géraud (1997). Degano, Pierpaolo; Gorrieri, Roberto; Marchetti-Spaccamela, Alberto (eds.). "The equivalence problem for deterministic pushdown automata is decidable". Automata, Languages and Programming. Lecture Notes in Computer Science. 1256. Springer Berlin Heidelberg: 671–681. doi:10.1007/3-540-63165-8_221. ISBN 9783540691945.
- Sénizergues, Géraud (2001). "L(A)=L(B)? decidability results from complete formal systems". Theoretical Computer Science. 251 (1–2): 1–166. doi:10.1016/S0304-3975(00)00285-1.
External links
| Gödel Prize laureates | |
|---|---|
|
  | This article about a French scientist is a stub. You can help Misplaced Pages by expanding it. |