Géraud Sénizergues (born 9 March 1957) is a French
computer scientist
A computer scientist is a scientist who specializes in the academic study of computer science.
Computer scientists typically work on the theoretical side of computation. Although computer scientists can also focus their work and research on ...
at the
University of Bordeaux
The University of Bordeaux (, ) is a public research university based in Nouvelle-Aquitaine in southwestern France.
It has several campuses in the cities and towns of Bordeaux, Dax, Gradignan, Périgueux, Pessac, and Talence. There are al ...
.
He is known for his contributions to
automata theory
Automata theory is the study of abstract machines and automata, as well as the computational problems that can be solved using them. It is a theory in theoretical computer science with close connections to cognitive science and mathematical l ...
,
combinatorial group theory In mathematics, combinatorial group theory is the theory of free groups, and the concept of a presentation of a group by generators and relations. It is much used in geometric topology, the fundamental group of a simplicial complex having in a na ...
and
abstract rewriting system
In mathematical logic and theoretical computer science, an abstract rewriting system (also (abstract) reduction system or abstract rewrite system; abbreviated ARS) is a formalism that captures the quintessential notion and properties of rewriting ...
s.
He received his
Ph.D. (Doctorat d'état en Informatique) from the
Université Paris Diderot (Paris 7) in 1987 under the direction of
Jean-Michel Autebert.
With
Yuri Matiyasevich
Yuri Vladimirovich Matiyasevich (; born 2 March 1947 in Leningrad
Saint Petersburg, formerly known as Petrograd and later Leningrad, is the List of cities and towns in Russia by population, second-largest city in Russia after Moscow. It is ...
he obtained results about the
Post correspondence problem
The Post correspondence problem is an undecidable decision problem that was introduced by Emil Post in 1946. Because it is simpler than the halting problem
In computability theory (computer science), computability theory, the halting problem ...
. He won the 2002
Gödel Prize
The Gödel Prize is an annual prize for outstanding papers in the area of theoretical computer science, given jointly by the European Association for Theoretical Computer Science (EATCS) and the Association for Computing Machinery Special Inter ...
"for proving that equivalence of
deterministic pushdown automata is
decidable".
In 2003 he was awarded with the
Gay-Lussac Humboldt Prize.
References
External links
Homepage*
Living people
French computer scientists
Academic staff of the University of Bordeaux
Gödel Prize laureates
1957 births
{{France-scientist-stub