1 citations · 1 across the 6 of their papers we have counts for
7 papers
Word-Mappings of level
G. Sénizergues
Sequences of numbers (either natural integers, or integers or rational) of level have been defined in \cite{Fra05,Fra-Sen06} as the sequences which can be comput…
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…
FREC 14: FRontiers of RECognizability
Géraud Sénizergues
These proceedings are gathering twelve different research papers developping the theory of recognizability for various kinds of discrete objects: words. terms, graphs, etc...
Equations over free inverse monoids with idempotent variables
Volker Diekert, Florent Martin, Geraud Senizergues +1
We introduce the notion of idempotent variables for studying equations in inverse monoids. It is proved that it is decidable in singly exponential time (DEXPTIME) whether a system…
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…
Bottom-up rewriting for words and terms
Irene Durand, Geraud Senizergues
For the whole class of linear term rewriting systems, we define \emph{bottom-up rewriting} which is a restriction of the usual notion of rewriting. We show that bottom-up rewriting…
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…