Géraud Sénizergues

From Wikipedia, the free encyclopedia

Géraud Sénizergues (born 1957) is a French computer scientist at the University of Bordeaux. He won the 2002 Gödel Prize "for proving that equivalence of deterministic pushdown automata is decidable"[1]

References

  1. ↑ Sénizergues, Géraud (2001), "L(A) = L(B)? decidability results from complete formal systems", Theor. Comput. Sci. (Essex, UK: Elsevier Science Publishers Ltd.) 251 (1): 1–166, doi:10.1016/S0304-3975(00)00285-1, ISSN 0304-3975 

External links

Gödel Prize laureates
Authority control


This article is issued from Wikipedia. The text is available under the Creative Commons Attribution/Share Alike; additional terms may apply for the media files.