Géraud Sénizergues

from Wikipedia, the free encyclopedia
Géraud Sénizergues

Géraud Sénizergues (* 1957 ) is a French computer scientist. He is a professor at the University of Bordeaux at the Computer Science Laboratory (LaBRI) there.

For his proof of the decidability of the question of the equivalence of deterministic push-down automata (i.e. the solution of the equivalence problem for deterministic push-down automata) he received the Gödel Prize in 2002 . In 2003 he received the Gay Lussac Humboldt Prize .

With Yuri Matiyasevich he achieved results on Post's correspondence problem .

Web links

Individual evidence

  1. Senizergues The equivalence of deterministic push-down automata is decidable , Lecture Notes in Computer Science 1256, Springer Verlag 1997, pp 671-681
  2. Senizergues: L (A) = L (B)? decidability results from complete formal systems , Theor. Comput. Science, Vol. 251, 2001, pp. 1-166
  3. Matyasevich, Senizergues: Decision problem for semi-Thue system with a few rules. In: Proc. 11th Symp. Logic in Computer Science. Springer, 1996, pp. 523-531