3 papers
math.GR2018
The isomorphism problem for finite extensions of free groups is in PSPACE
Géraud Sénizergues, Armin Weiß
We present an algorithm for the following problem: given a context-free grammar for the word problem of a virtually free group , compute a finite graph of groups w…
cs.FL2011
Jancar's formal system for deciding bisimulation of first-order grammars and its non-soundness
Géraud Sénizergues
We construct an example of proof within the main formal system from arXiv:1010.4760v3, which is intended to capture the bisimulation equivalence for non-deterministic first-order g…
cs.LO2000
The Bisimulation Problem for equational graphs of finite out-degree
G. Senizergues
The "bisimulation problem" for equational graphs of finite out-degree is shown to be decidable. We reduce this problem to the bisimulation problem for deterministic rational (vecto…