Géraud Sénizergues

From Wikipedia, the free encyclopedia
Jump to: navigation, search
Géraud Sénizergues, September 2017

Géraud Sénizergues (born 1957) is a French computer scientist at the University of Bordeaux. With Yuri Matiyasevich he obtained results about the Post correspondence problem[1]. He won the 2002 Gödel Prize "for proving that equivalence of deterministic pushdown automata is decidable"[2] [3][4]. In 2003 he was awarded with the Gay-Lussac-Humboldt-Prize.



  1. ^ Matyasevich, Senizergues: Decision Problems for Semi-Thue Systems with a few Rules. In: Proc. 11th Symp. Logic in Computer Science. Springer, 1996, S. 523–531
  2. ^ "ACM SIGACT: Prizes: Gödel". 
  3. ^ Senizergues The equivalence of deterministic push-down automata is decidable, Lecture Notes in Computer Science 1256, Springer Verlag 1997, S. 671–681
  4. ^ Senizergues: L(A) = L(B)? decidability results from complete formal systems, Theor. Comput. Science, Band 251, 2001, S. 1–166

External links[edit]