Géraud Sénizergues

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
Géraud Sénizergues
Sénizergues in September 2017
Born1957 (age 61–62)
Scientific career
FieldsComputer science
InstitutionsUniversity of Bordeaux

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. ^ 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: 523–531. doi:10.1109/LICS.1996.561469. ISBN 9780818674631.
  2. ^ "2002 Gödel Prize". sigact.org. Retrieved 2019-05-10.
  3. ^ 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. Springer Berlin Heidelberg: 671–681. doi:10.1007/3-540-63165-8_221. ISBN 9783540691945.
  4. ^ Sénizergues, Géraud (2001). "L(A)=L(B)? decidability results from complete formal systems". Theoretical Computer Science. 251 (1–2): 1–166 – via Elsevier ScienceDirect.

External links[edit]