Géraud Sénizergues

Known as: Geraud Senizergues, Géraud Senizergues 
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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

2000-2017
01220002017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2017
Review
2017
This special issue is devoted to a broad range of theoretical topics in Computer Science, including computational complexity… (More)
Is this relevant?
2017
2017
Equivalence of deterministic pushdown automata is a famous problem in theoretical computer science whose decidability has been… (More)
  • figure 1
  • figure 2
Is this relevant?
2013
2013
A recursion scheme is an orthogonal rewriting system with rules of the form f(x1, . . . , xn) → s. We consider terms to be… (More)
  • figure 1
Is this relevant?
2013
2013
Broadbent and Göller (FSTTCS 2012) proved the undecidability of bisimulation equivalence for processes generated by ε-free second… (More)
  • figure 1
  • figure 2
Is this relevant?
2012
2012
A self-contained proof of the decidability of bisimulation equivalence for first-order grammars is given. This provides an… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 7
Is this relevant?
2006
2006
We answer an open question related to bisimilarity checking on labelled transition systems generated by prefix rewrite rules on… (More)
Is this relevant?
2000
2000
Two schema problems from the 1970s are examined, monadic recursion schemes and first-order recursion schemas. Research on these… (More)
Is this relevant?