A New Class of C.F.L. for Which the Equivalence is Decidable. - Géraud Sénizergues (Inf. Process. Lett., 1981)

The equivalence problem for N.T.S. languages is decidable. - Géraud Sénizergues (Theoretical Computer Science, 1983)

Langages de Parenthèses, Langages N.T.S. et Homomorphismes Inverses. - Jean-Michel Autebert; Luc Boasson; Géraud Sénizergues (RAIRO Theor. Informatics Appl., 1984)

Remarques sur les Langages de Parenthèses. - Jean-Michel Autebert; Joffroy Beauquier; Luc Boasson; Géraud Sénizergues (Theor. Comput. Sci., 1984)

NTS Languages Are Deterministic and Congruential. - Luc Boasson; Géraud Sénizergues (J. Comput. Syst. Sci., 1985)

The Equivalence and Inclusion Problems for NTS Languages. - Géraud Sénizergues (J. Comput. Syst. Sci., 1985)

Groups and NTS Languages. - Jean-Michel Autebert; Luc Boasson; Géraud Sénizergues (J. Comput. Syst. Sci., 1987)

Church-Rosser Controller Rewriting Systems and Equivalence problems for Deterministic Context-Free Languages - Géraud Sénizergues (Inf. Comput., 1989)

A Characterisation of Deterministic Context-Free Languages by Means of Right-Congruences. - Géraud Sénizergues (Theor. Comput. Sci., 1990)

Some Decision Problems about Controlled Rewriting Systems. - Géraud Sénizergues (Theor. Comput. Sci., 1990)

Formal Languages and Word-Rewriting. - Géraud Sénizergues (Term Rewriting, 1993)

An Effective Version of Stallings' Theorem in the Case of Context-Free Groups. - Géraud Sénizergues (ICALP, 1993)

Some Undecidable Termination Problems for Semi-Thue Systems (Abstract). - Géraud Sénizergues (RTA, 1993)

On the finite subgroups of a context-free group. - Géraud Sénizergues (Geometric and Computational Perspectives on Infinite Groups, 1994)

The Obstructions of a Minor-Closed Set of Graphs Defined by Hyperedge Replacement can be Constructed. - Bruno Courcelle; Géraud Sénizergues (TAGT, 1994)

Some Undecidable Termination Problems for Semi-Thue Systems. - Géraud Sénizergues (Theor. Comput. Sci., 1995)

Semi-Groups Acting on Context-Free Graphs. - Géraud Sénizergues (ICALP, 1996)

On the Termination Problem for One-Rule Semi-Thue System. - Géraud Sénizergues (RTA, 1996)

On the Rational Subsets of the Free Group. - Géraud Sénizergues (Acta Informatica, 1996)

The Equivalence Problem for Deterministic Pushdown Automata is Decidable. - Géraud Sénizergues (ICALP, 1997)

L(A) = L(B)? - Géraud Sénizergues (INFINITY, 1997)

Decidability of Bisimulation Equivalence for Equational Graphs of Finite Out-Degree. - Géraud Sénizergues (FOCS, 1998)

The Equivalence Problem for Deterministic Pushdown Transducers into Abelian Groups. - Géraud Sénizergues (MFCS, 1998)

The obstructions of a minor-closed set of graphs defined by a context-free grammar. - Bruno Courcelle; Géraud Sénizergues (Discret. Math., 1998)

A Polynomial Algorithm Testing Partial Confluence of Basic Semi-Thue Systems. - Géraud Sénizergues (Theor. Comput. Sci., 1998)

T(A) = T(B)? - Géraud Sénizergues (ICALP, 1999)

Complete formal systems for equivalence problems. - Géraud Sénizergues (Theor. Comput. Sci., 2000)

Some Applications of the Decidability of DPDA's Equivalence. - Géraud Sénizergues (MCU, 2001)

L(A)=L(B)? decidability results from complete formal systems. - Géraud Sénizergues (Theor. Comput. Sci., 2001)

L(A)=L(B)? A simplified decidability proof. - Géraud Sénizergues (Theor. Comput. Sci., 2002)

The Equivalence Problem for t-Turn DPDA Is Co-NP. - Géraud Sénizergues (ICALP, 2003)

The Bisimulation Problem for Equational Graphs of Finite Out-Degree. - Géraud Sénizergues (SIAM J. Comput., 2005)

Decision problems for semi-Thue systems with a few rules. - Yuri V. Matiyasevich; Géraud Sénizergues (Theor. Comput. Sci., 2005)

Theories of HNN-Extensions and Amalgamated Products. - Markus Lohrey; Géraud Sénizergues (ICALP (2), 2006)

Iterated pushdown automata and sequences of rational numbers. - S. Fratani; Géraud Sénizergues (Ann. Pure Appl. Log., 2006)

Sequences of Level 1, 2, 3, ..., k , ... - Géraud Sénizergues (CSR, 2007)

Bottom-Up Rewriting Is Inverse Recognizability Preserving. - Irène Durand; Géraud Sénizergues (RTA, 2007)

Equations in Free Inverse Monoids. - Timothy Deis; John C. Meakin; Géraud Sénizergues (Int. J. Algebra Comput., 2007)

Rational Subsets in HNN-Extensions and Amalgamated Products. - Markus Lohrey; Géraud Sénizergues (Int. J. Algebra Comput., 2008)

Tree Automata and Automata on Linear Orderings. - Véronique Bruyère; Olivier Carton; Géraud Sénizergues (RAIRO Theor. Informatics Appl., 2009)

Termination of linear bounded term rewriting systems. - Irène Durand; Géraud Sénizergues; Marc Sylvestre (RTA, 2010)

Jancar's formal system for deciding bisimulation of first-order grammars and its non-soundness - Géraud Sénizergues (CoRR, 2011)

LALBLC A Program Testing the Equivalence of dpda's. - Patrick Henry; Géraud Sénizergues (CIAA, 2013)

FREC 14: FRontiers of RECognizability. - Géraud Sénizergues (CoRR, 2014)

Word-Mappings of Level 2. - Julien Ferté; Nathalie Marin; Géraud Sénizergues (Theory Comput. Syst., 2014)

Bottom-up rewriting for words and terms. - Irène Durand; Géraud Sénizergues (J. Symb. Comput., 2015)

Equations Over Free Inverse Monoids with Idempotent Variables. - Volker Diekert; Florent Martin; Géraud Sénizergues; Pedro V. Silva (Theory Comput. Syst., 2017)

The Isomorphism Problem for Finite Extensions of Free Groups Is In PSPACE. - Géraud Sénizergues; Armin Weiß (ICALP, 2018)

Regular matching problems for infinite trees. - Carlos Camino; Volker Diekert; Besik Dundua; Mircea Marin; Géraud Sénizergues (Log. Methods Comput. Sci., 2022)

Word-Mappings of level 3. - Géraud Sénizergues (CoRR, 2023)

On Polynomial Recursive Sequences. - Michaël Cadilhac; Filip Mazowiecki; Charles Paperman; Michal Pilipczuk; Géraud Sénizergues (Theory Comput. Syst., 2024)