default search action
Géraud Sénizergues
Person information
- affiliation: University of Bordeaux, France
- award (2002): Gödel Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j27]Michaël Cadilhac
, Filip Mazowiecki
On Polynomial Recursive Sequences. Theory Comput. Syst. 68(4): 593-614 (2024) - 2023
- [i9]Géraud Sénizergues:
Word-Mappings of level 3. CoRR abs/2301.09966 (2023) - 2022
- [j26]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) - 2020
- [c27]Michaël Cadilhac
On Polynomial Recursive Sequences. ICALP 2020: 117:1-117:17 - [i8]Michaël Cadilhac, Filip Mazowiecki, Charles Paperman, Michal Pilipczuk, Géraud Sénizergues:
On polynomial recursive sequences. CoRR abs/2002.08630 (2020) - [i7]Carlos Camino, Volker Diekert, Besik Dundua, Mircea Marin, Géraud Sénizergues:
Regular matching problems for infinite trees. CoRR abs/2004.09926 (2020)
2010 – 2019
- 2018
- [c26]Géraud Sénizergues, Armin Weiß
The Isomorphism Problem for Finite Extensions of Free Groups Is In PSPACE. ICALP 2018: 139:1-139:14 - [i6]Géraud Sénizergues, Armin Weiß:
The isomorphism problem for finite extensions of free groups is in PSPACE. CoRR abs/1802.07085 (2018) - 2017
- [j25]Volker Diekert, Florent Martin, Géraud Sénizergues, Pedro V. Silva
Equations Over Free Inverse Monoids with Idempotent Variables. Theory Comput. Syst. 61(2): 494-520 (2017) - 2015
- [j24]Irène Durand, Géraud Sénizergues:
Bottom-up rewriting for words and terms. J. Symb. Comput. 67: 93-121 (2015) - [c25]Volker Diekert, Florent Martin, Géraud Sénizergues, Pedro V. Silva
Equations over Free Inverse Monoids with Idempotent Variables. CSR 2015: 173-188 - 2014
- [j23]Julien Ferté, Nathalie Marin, Géraud Sénizergues:
Word-Mappings of Level 2. Theory Comput. Syst. 54(1): 111-148 (2014) - [i5]Géraud Sénizergues:
FREC 14: FRontiers of RECognizability. CoRR abs/1411.5611 (2014) - [i4]Volker Diekert, Florent Martin
Equations over free inverse monoids with idempotent variables. CoRR abs/1412.4737 (2014) - 2013
- [c24]Patrick Henry, Géraud Sénizergues:
LALBLC A Program Testing the Equivalence of dpda's. CIAA 2013: 169-180 - 2011
- [i3]Géraud Sénizergues:
Jancar's formal system for deciding bisimulation of first-order grammars and its non-soundness. CoRR abs/1101.5046 (2011) - 2010
- [c23]Irène Durand, Géraud Sénizergues, Marc Sylvestre:
Termination of linear bounded term rewriting systems. RTA 2010: 341-356
2000 – 2009
- 2009
- [j22]Véronique Bruyère, Olivier Carton
Tree Automata and Automata on Linear Orderings. RAIRO Theor. Informatics Appl. 43(2): 321-338 (2009) - [i2]Irène Durand, Géraud Sénizergues:
Bottom-up rewriting for words and terms. CoRR abs/0903.2554 (2009) - 2008
- [j21]Markus Lohrey, Géraud Sénizergues:
Rational Subsets in HNN-Extensions and Amalgamated Products. Int. J. Algebra Comput. 18(1): 111-163 (2008) - 2007
- [j20]Timothy Deis, John C. Meakin, Géraud Sénizergues:
Equations in Free Inverse Monoids. Int. J. Algebra Comput. 17(4): 761-795 (2007) - [c22]Géraud Sénizergues:
Sequences of Level 1, 2, 3, ..., k , ... CSR 2007: 24-32 - [c21]Irène Durand, Géraud Sénizergues:
Bottom-Up Rewriting Is Inverse Recognizability Preserving. RTA 2007: 107-121 - 2006
- [j19]S. Fratani, Géraud Sénizergues:
Iterated pushdown automata and sequences of rational numbers. Ann. Pure Appl. Log. 141(3): 363-411 (2006) - [c20]Markus Lohrey, Géraud Sénizergues:
Theories of HNN-Extensions and Amalgamated Products. ICALP (2) 2006: 504-515 - 2005
- [j18]Géraud Sénizergues:
The Bisimulation Problem for Equational Graphs of Finite Out-Degree. SIAM J. Comput. 34(5): 1025-1106 (2005) - [j17]Yuri V. Matiyasevich
Decision problems for semi-Thue systems with a few rules. Theor. Comput. Sci. 330(1): 145-169 (2005) - 2003
- [c19]Géraud Sénizergues:
The Equivalence Problem for t-Turn DPDA Is Co-NP. ICALP 2003: 478-489 - 2002
- [j16]Géraud Sénizergues:
L(A)=L(B)? A simplified decidability proof. Theor. Comput. Sci. 281(1-2): 555-608 (2002) - [c18]Géraud Sénizergues:
L(A) = L(B)? Decidability Results from Complete Formal Systems. ICALP 2002: 37 - 2001
- [j15]Géraud Sénizergues:
L(A)=L(B)? decidability results from complete formal systems. Theor. Comput. Sci. 251(1-2): 1-166 (2001) - [c17]Géraud Sénizergues:
Some Applications of the Decidability of DPDA's Equivalence. MCU 2001: 114-132 - 2000
- [j14]Géraud Sénizergues:
Complete formal systems for equivalence problems. Theor. Comput. Sci. 231(2): 309-334 (2000) - [i1]Géraud Sénizergues:
The Bisimulation Problem for equational graphs of finite out-degree. CoRR cs.LO/0008018 (2000)
1990 – 1999
- 1999
- [c16]Géraud Sénizergues:
T(A) = T(B)? ICALP 1999: 665-675 - 1998
- [j13]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): 29-51 (1998) - [j12]Géraud Sénizergues:
A Polynomial Algorithm Testing Partial Confluence of Basic Semi-Thue Systems. Theor. Comput. Sci. 192(1): 55-75 (1998) - [c15]Géraud Sénizergues:
Decidability of Bisimulation Equivalence for Equational Graphs of Finite Out-Degree. FOCS 1998: 120-129 - [c14]Géraud Sénizergues:
Complete Formal Systems for Equivalence Problems. MCU (1) 1998: 22-49 - [c13]Géraud Sénizergues:
The Equivalence Problem for Deterministic Pushdown Transducers into Abelian Groups. MFCS 1998: 305-315 - 1997
- [c12]Géraud Sénizergues:
The Equivalence Problem for Deterministic Pushdown Automata is Decidable. ICALP 1997: 671-681 - [c11]Géraud Sénizergues:
L(A) = L(B)? INFINITY 1997: 43 - 1996
- [j11]Géraud Sénizergues:
On the Rational Subsets of the Free Group. Acta Informatica 33(3): 281-296 (1996) - [c10]Géraud Sénizergues:
Semi-Groups Acting on Context-Free Graphs. ICALP 1996: 206-218 - [c9]Yuri V. Matiyasevich, Géraud Sénizergues:
Decision Problems for Semi-Thue Systems with a Few Rules. LICS 1996: 523-531 - [c8]Géraud Sénizergues:
On the Termination Problem for One-Rule Semi-Thue System. RTA 1996: 302-316 - 1995
- [j10]Géraud Sénizergues:
Some Undecidable Termination Problems for Semi-Thue Systems. Theor. Comput. Sci. 142(2): 257-276 (1995) - [c7]Géraud Sénizergues:
A Polynomial Algorithm Testing Partial Confluence of Basic Semi-Thue Systems. RTA 1995: 194-209 - 1994
- [c6]Géraud Sénizergues:
On the finite subgroups of a context-free group. Geometric and Computational Perspectives on Infinite Groups 1994: 201-212 - [c5]Bruno Courcelle, Géraud Sénizergues:
The Obstructions of a Minor-Closed Set of Graphs Defined by Hyperedge Replacement can be Constructed. TAGT 1994: 351-367 - 1993
- [c4]Géraud Sénizergues:
Formal Languages and Word-Rewriting. Term Rewriting 1993: 75-94 - [c3]Géraud Sénizergues:
An Effective Version of Stallings' Theorem in the Case of Context-Free Groups. ICALP 1993: 478-495 - [c2]Géraud Sénizergues:
Some Undecidable Termination Problems for Semi-Thue Systems (Abstract). RTA 1993: 434 - 1990
- [j9]Géraud Sénizergues:
A Characterisation of Deterministic Context-Free Languages by Means of Right-Congruences. Theor. Comput. Sci. 70(2): 213-232 (1990) - [j8]Géraud Sénizergues:
Some Decision Problems about Controlled Rewriting Systems. Theor. Comput. Sci. 71(3): 281-346 (1990)
1980 – 1989
- 1989
- [j7]Géraud Sénizergues:
Church-Rosser Controller Rewriting Systems and Equivalence problems for Deterministic Context-Free Languages. Inf. Comput. 81(3): 265-279 (1989) - 1987
- [j6]Jean-Michel Autebert, Luc Boasson, Géraud Sénizergues:
Groups and NTS Languages. J. Comput. Syst. Sci. 35(2): 243-267 (1987) - 1985
- [j5]Géraud Sénizergues:
The Equivalence and Inclusion Problems for NTS Languages. J. Comput. Syst. Sci. 31(3): 303-331 (1985) - [j4]Luc Boasson, Géraud Sénizergues:
NTS Languages Are Deterministic and Congruential. J. Comput. Syst. Sci. 31(3): 332-342 (1985) - 1984
- [j3]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): 327-344 (1984) - [j2]Jean-Michel Autebert, Joffroy Beauquier, Luc Boasson, Géraud Sénizergues:
Remarques sur les Langages de Parenthèses. Theor. Comput. Sci. 31: 337-349 (1984) - 1983
- [c1]Géraud Sénizergues:
The equivalence problem for N.T.S. languages is decidable. Theoretical Computer Science 1983: 313-323 - 1981
- [j1]Géraud Sénizergues:
A New Class of C.F.L. for Which the Equivalence is Decidable. Inf. Process. Lett. 13(1): 30-34 (1981)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: