Géraud Sénizergues

Publication Activity (10 Years)

Years Active: 1981-2023
Publications (10 Years): 8

Top Topics

Jacobian Matrix

Top Venues

Theory Comput. Syst.

Publications

Géraud Sénizergues
Word-Mappings of level 3. CoRR (2023)
Carlos Camino, Volker Diekert, Besik Dundua, Mircea Marin, Géraud Sénizergues
Regular matching problems for infinite trees. Log. Methods Comput. Sci. 18 (1) (2022)
Michaël Cadilhac, Filip Mazowiecki, Charles Paperman, Michal Pilipczuk, Géraud Sénizergues
On Polynomial Recursive Sequences. ICALP (2020)
Michaël Cadilhac, Filip Mazowiecki, Charles Paperman, Michal Pilipczuk, Géraud Sénizergues
On polynomial recursive sequences. CoRR (2020)
Carlos Camino, Volker Diekert, Besik Dundua, Mircea Marin, Géraud Sénizergues
Regular matching problems for infinite trees. CoRR (2020)
Géraud Sénizergues, Armin Weiß
The isomorphism problem for finite extensions of free groups is in PSPACE. CoRR (2018)
Géraud Sénizergues, Armin Weiß
The Isomorphism Problem for Finite Extensions of Free Groups Is In PSPACE. ICALP (2018)
Volker Diekert, Florent Martin, Géraud Sénizergues, Pedro V. Silva
Equations Over Free Inverse Monoids with Idempotent Variables. Theory Comput. Syst. 61 (2) (2017)
Irène Durand, Géraud Sénizergues
Bottom-up rewriting for words and terms. J. Symb. Comput. 67 (2015)
Volker Diekert, Florent Martin, Géraud Sénizergues, Pedro V. Silva
Equations over Free Inverse Monoids with Idempotent Variables. CSR (2015)
Volker Diekert, Florent Martin, Géraud Sénizergues, Pedro V. Silva
Equations over free inverse monoids with idempotent variables. CoRR (2014)
Géraud Sénizergues
FREC 14: FRontiers of RECognizability. CoRR (2014)
Julien Ferté, Nathalie Marin, Géraud Sénizergues
Word-Mappings of Level 2. Theory Comput. Syst. 54 (1) (2014)
Patrick Henry, Géraud Sénizergues
LALBLC A Program Testing the Equivalence of dpda's. CIAA (2013)
Géraud Sénizergues
Jancar's formal system for deciding bisimulation of first-order grammars and its non-soundness CoRR (2011)
Irène Durand, Géraud Sénizergues, Marc Sylvestre
Termination of linear bounded term rewriting systems. RTA (2010)
Irène Durand, Géraud Sénizergues
Bottom-up rewriting for words and terms CoRR (2009)
Véronique Bruyère, Olivier Carton, Géraud Sénizergues
Tree Automata and Automata on Linear Orderings. RAIRO Theor. Informatics Appl. 43 (2) (2009)
Markus Lohrey, Géraud Sénizergues
Rational Subsets in HNN-Extensions and Amalgamated Products. Int. J. Algebra Comput. 18 (1) (2008)
Irène Durand, Géraud Sénizergues
Bottom-Up Rewriting Is Inverse Recognizability Preserving. RTA (2007)
Timothy Deis, John C. Meakin, Géraud Sénizergues
Equations in Free Inverse Monoids. Int. J. Algebra Comput. 17 (4) (2007)
Géraud Sénizergues
, ... CSR (2007)
S. Fratani, Géraud Sénizergues
Iterated pushdown automata and sequences of rational numbers. Ann. Pure Appl. Log. 141 (3) (2006)
Markus Lohrey, Géraud Sénizergues
Theories of HNN-Extensions and Amalgamated Products. ICALP (2) (2006)
Yuri V. Matiyasevich, Géraud Sénizergues
Decision problems for semi-Thue systems with a few rules. Theor. Comput. Sci. 330 (1) (2005)
Géraud Sénizergues
The Bisimulation Problem for Equational Graphs of Finite Out-Degree. SIAM J. Comput. 34 (5) (2005)
Géraud Sénizergues
The Equivalence Problem for t-Turn DPDA Is Co-NP. ICALP (2003)
Géraud Sénizergues
L(A) = L(B)? Decidability Results from Complete Formal Systems. ICALP (2002)
Géraud Sénizergues
L(A)=L(B)? A simplified decidability proof. Theor. Comput. Sci. 281 (1-2) (2002)
Géraud Sénizergues
L(A)=L(B)? decidability results from complete formal systems. Theor. Comput. Sci. 251 (1-2) (2001)
Géraud Sénizergues
Some Applications of the Decidability of DPDA's Equivalence. MCU (2001)
Géraud Sénizergues
The Bisimulation Problem for equational graphs of finite out-degree CoRR (2000)
Géraud Sénizergues
Complete formal systems for equivalence problems. Theor. Comput. Sci. 231 (2) (2000)
Géraud Sénizergues
T(A) = T(B)? ICALP (1999)
Géraud Sénizergues
Complete Formal Systems for Equivalence Problems. MCU (1) (1998)
Géraud Sénizergues
The Equivalence Problem for Deterministic Pushdown Transducers into Abelian Groups. MFCS (1998)
Géraud Sénizergues
Decidability of Bisimulation Equivalence for Equational Graphs of Finite Out-Degree. FOCS (1998)
Bruno Courcelle, Géraud Sénizergues
The obstructions of a minor-closed set of graphs defined by a context-free grammar. Discret. Math. 182 (1-3) (1998)
Géraud Sénizergues
A Polynomial Algorithm Testing Partial Confluence of Basic Semi-Thue Systems. Theor. Comput. Sci. 192 (1) (1998)
Géraud Sénizergues
L(A) = L(B)? INFINITY (1997)
Géraud Sénizergues
The Equivalence Problem for Deterministic Pushdown Automata is Decidable. ICALP (1997)
Géraud Sénizergues
On the Rational Subsets of the Free Group. Acta Informatica 33 (3) (1996)
Géraud Sénizergues
On the Termination Problem for One-Rule Semi-Thue System. RTA (1996)
Géraud Sénizergues
Semi-Groups Acting on Context-Free Graphs. ICALP (1996)
Yuri V. Matiyasevich, Géraud Sénizergues
Decision Problems for Semi-Thue Systems with a Few Rules. LICS (1996)
Géraud Sénizergues
Some Undecidable Termination Problems for Semi-Thue Systems. Theor. Comput. Sci. 142 (2) (1995)
Géraud Sénizergues
A Polynomial Algorithm Testing Partial Confluence of Basic Semi-Thue Systems. RTA (1995)
Géraud Sénizergues
On the finite subgroups of a context-free group. Geometric and Computational Perspectives on Infinite Groups (1994)
Bruno Courcelle, Géraud Sénizergues
The Obstructions of a Minor-Closed Set of Graphs Defined by Hyperedge Replacement can be Constructed. TAGT (1994)
Géraud Sénizergues
An Effective Version of Stallings' Theorem in the Case of Context-Free Groups. ICALP (1993)
Géraud Sénizergues
Formal Languages and Word-Rewriting. Term Rewriting (1993)
Géraud Sénizergues
Some Undecidable Termination Problems for Semi-Thue Systems (Abstract). RTA (1993)
Géraud Sénizergues
Some Decision Problems about Controlled Rewriting Systems. Theor. Comput. Sci. 71 (3) (1990)
Géraud Sénizergues
A Characterisation of Deterministic Context-Free Languages by Means of Right-Congruences. Theor. Comput. Sci. 70 (2) (1990)
Géraud Sénizergues
Church-Rosser Controller Rewriting Systems and Equivalence problems for Deterministic Context-Free Languages Inf. Comput. 81 (3) (1989)
Jean-Michel Autebert, Luc Boasson, Géraud Sénizergues
Groups and NTS Languages. J. Comput. Syst. Sci. 35 (2) (1987)
Luc Boasson, Géraud Sénizergues
NTS Languages Are Deterministic and Congruential. J. Comput. Syst. Sci. 31 (3) (1985)
Géraud Sénizergues
The Equivalence and Inclusion Problems for NTS Languages. J. Comput. Syst. Sci. 31 (3) (1985)
Jean-Michel Autebert, Joffroy Beauquier, Luc Boasson, Géraud Sénizergues
Remarques sur les Langages de Parenthèses. Theor. Comput. Sci. 31 (1984)
Jean-Michel Autebert, Luc Boasson, Géraud Sénizergues
Langages de Parenthèses, Langages N.T.S. et Homomorphismes Inverses. RAIRO Theor. Informatics Appl. 18 (4) (1984)
Géraud Sénizergues
The equivalence problem for N.T.S. languages is decidable. Theoretical Computer Science (1983)
Géraud Sénizergues
A New Class of C.F.L. for Which the Equivalence is Decidable. Inf. Process. Lett. 13 (1) (1981)