Géraud Sénizergues

According to our database, Géraud Sénizergues authored at least 51 papers between 1981 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

2024

On Polynomial Recursive Sequences.

Michaël Cadilhac, Filip Mazowiecki, Charles Paperman, Michal Pilipczuk, Géraud Sénizergues

Theory Comput. Syst., August, 2024

2023

Word-Mappings of level 3.

Géraud Sénizergues

CoRR, 2023

2022

Regular matching problems for infinite trees.

Carlos Camino, Volker Diekert, Besik Dundua, Mircea Marin, Géraud Sénizergues

Log. Methods Comput. Sci., 2022

2018

The Isomorphism Problem for Finite Extensions of Free Groups Is In PSPACE.

Géraud Sénizergues, Armin Weiß

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017

Equations Over Free Inverse Monoids with Idempotent Variables.

Volker Diekert, Florent Martin, Géraud Sénizergues, Pedro V. Silva

Theory Comput. Syst., 2017

2015

Bottom-up rewriting for words and terms.

Irène Durand, Géraud Sénizergues

J. Symb. Comput., 2015

2014

Word-Mappings of Level 2.

Julien Ferté, Nathalie Marin, Géraud Sénizergues

Theory Comput. Syst., 2014

FREC 14: FRontiers of RECognizability.

Géraud Sénizergues

CoRR, 2014

2013

LALBLC A Program Testing the Equivalence of dpda's.

Patrick Henry, Géraud Sénizergues

Proceedings of the Implementation and Application of Automata, 2013

2011

Jancar's formal system for deciding bisimulation of first-order grammars and its non-soundness

Géraud Sénizergues

CoRR, 2011

2010

Termination of linear bounded term rewriting systems.

Irène Durand, Géraud Sénizergues, Marc Sylvestre

Proceedings of the 21st International Conference on Rewriting Techniques and Applications, 2010

2009

Tree Automata and Automata on Linear Orderings.

Véronique Bruyère, Olivier Carton, Géraud Sénizergues

RAIRO Theor. Informatics Appl., 2009

2008

Rational Subsets in HNN-Extensions and Amalgamated Products.

Markus Lohrey, Géraud Sénizergues

Int. J. Algebra Comput., 2008

2007

Equations in Free Inverse Monoids.

Timothy Deis, John C. Meakin, Géraud Sénizergues

Int. J. Algebra Comput., 2007

Bottom-Up Rewriting Is Inverse Recognizability Preserving.

Irène Durand, Géraud Sénizergues

Proceedings of the Term Rewriting and Applications, 18th International Conference, 2007

Sequences of Level 1, 2, 3, ..., <i>k</i> , ...

Géraud Sénizergues

Proceedings of the Computer Science, 2007

2006

Iterated pushdown automata and sequences of rational numbers.

S. Fratani, Géraud Sénizergues

Ann. Pure Appl. Log., 2006

Theories of HNN-Extensions and Amalgamated Products.

Markus Lohrey, Géraud Sénizergues

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005

Decision problems for semi-Thue systems with a few rules.

Yuri V. Matiyasevich, Géraud Sénizergues

Theor. Comput. Sci., 2005

The Bisimulation Problem for Equational Graphs of Finite Out-Degree.

Géraud Sénizergues

SIAM J. Comput., 2005

2003

The Equivalence Problem for t-Turn DPDA Is Co-NP.

Géraud Sénizergues

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002

L(A)=L(B)? A simplified decidability proof.

Géraud Sénizergues

Theor. Comput. Sci., 2002

2001

L(A)=L(B)? decidability results from complete formal systems.

Géraud Sénizergues

Theor. Comput. Sci., 2001

Some Applications of the Decidability of DPDA's Equivalence.

Géraud Sénizergues

Proceedings of the Machines, 2001

2000

Complete formal systems for equivalence problems.

Géraud Sénizergues

Theor. Comput. Sci., 2000

1999

T(A) = T(B)?

Géraud Sénizergues

Proceedings of the Automata, 1999

1998

A Polynomial Algorithm Testing Partial Confluence of Basic Semi-Thue Systems.

Géraud Sénizergues

Theor. Comput. Sci., 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

The Equivalence Problem for Deterministic Pushdown Transducers into Abelian Groups.

Géraud Sénizergues

Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

Decidability of Bisimulation Equivalence for Equational Graphs of Finite Out-Degree.

Géraud Sénizergues

Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

1997

L(A) = L(B)?

Géraud Sénizergues

Proceedings of the Second International Workshop on Verification of Infinite State Systems, 1997

The Equivalence Problem for Deterministic Pushdown Automata is Decidable.

Géraud Sénizergues

Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

1996

On the Rational Subsets of the Free Group.

Géraud Sénizergues

Acta Informatica, 1996

On the Termination Problem for One-Rule Semi-Thue System.

Géraud Sénizergues

Proceedings of the Rewriting Techniques and Applications, 7th International Conference, 1996

Semi-Groups Acting on Context-Free Graphs.

Géraud Sénizergues

Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996

1995

Some Undecidable Termination Problems for Semi-Thue Systems.

Géraud Sénizergues

Theor. Comput. Sci., 1995

1994

The Obstructions of a Minor-Closed Set of Graphs Defined by Hyperedge Replacement can be Constructed.

Bruno Courcelle, Géraud Sénizergues

Proceedings of the Graph Gramars and Their Application to Computer Science, 1994

On the finite subgroups of a context-free group.

Géraud Sénizergues

Proceedings of the Geometric and Computational Perspectives on Infinite Groups, 1994

1993

Some Undecidable Termination Problems for Semi-Thue Systems (Abstract).

Géraud Sénizergues

Proceedings of the Rewriting Techniques and Applications, 5th International Conference, 1993

An Effective Version of Stallings' Theorem in the Case of Context-Free Groups.

Géraud Sénizergues

Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

Formal Languages and Word-Rewriting.

Géraud Sénizergues

Proceedings of the Term Rewriting, 1993

1990

Some Decision Problems about Controlled Rewriting Systems.

Géraud Sénizergues

Theor. Comput. Sci., 1990

A Characterisation of Deterministic Context-Free Languages by Means of Right-Congruences.

Géraud Sénizergues

Theor. Comput. Sci., 1990

1989

Church-Rosser Controller Rewriting Systems and Equivalence problems for Deterministic Context-Free Languages

Géraud Sénizergues

Inf. Comput., June, 1989

1987

Groups and NTS Languages.

Jean-Michel Autebert, Luc Boasson, Géraud Sénizergues

J. Comput. Syst. Sci., 1987

1985

The Equivalence and Inclusion Problems for NTS Languages.

Géraud Sénizergues

J. Comput. Syst. Sci., 1985

NTS Languages Are Deterministic and Congruential.

Luc Boasson, Géraud Sénizergues

J. Comput. Syst. Sci., 1985

1984

Remarques sur les Langages de Parenthèses.

Jean-Michel Autebert, Joffroy Beauquier, Luc Boasson, Géraud Sénizergues

Theor. Comput. Sci., 1984

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

1983

The equivalence problem for N.T.S. languages is decidable.

Géraud Sénizergues

Proceedings of the Theoretical Computer Science, 1983

1981

A New Class of C.F.L. for Which the Equivalence is Decidable.

Géraud Sénizergues

Inf. Process. Lett., 1981