Géraud Sénizergues

Géraud Sénizergues (* 1957) ist ein französischer Informatiker. Er ist Professor an der Universität Bordeaux am dortigen Labor für Informatik (LaBRI).

Géraud Sénizergues

Für seinen Beweis der Entscheidbarkeit der Frage der Äquivalenz von deterministischen Kellerautomaten (d. h. die Lösung des Äquivalenzproblems für deterministische Kellerautomaten) erhielt er 2002 den Gödel-Preis.[1][2] 2003 erhielt er den Gay-Lussac-Humboldt-Preis.

Mit Yuri Matiyasevich erzielte er Resultate zum Postschen Korrespondenzproblem.[3]

Weblinks

Homepage

Einzelnachweise

Senizergues The equivalence of deterministic push-down automata is decidable, Lecture Notes in Computer Science 1256, Springer Verlag 1997, S. 671–681
Senizergues: L(A) = L(B)? decidability results from complete formal systems, Theor. Comput. Science, Band 251, 2001, S. 1–166
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

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. The authors of the article are listed here. Additional terms may apply for the media files, click on images to show image meta data.

[1] Senizergues The equivalence of deterministic push-down automata is decidable, Lecture Notes in Computer Science 1256, Springer Verlag 1997, S. 671–681

[2] Senizergues: L(A) = L(B)? decidability results from complete formal systems, Theor. Comput. Science, Band 251, 2001, S. 1–166

[3] 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