Géraud Sénizergues

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