Géraud Sénizergues

Available identifiers

zbMath Open senizergues.geraudWikidataQ3124458 ScholiaQ3124458MaRDI QIDQ580991

List of research outcomes

Publication	Date of Publication	Type
A polynomial algorithm testing partial confluence of basic semi-Thue systems	2022-12-09	Paper
On the termination problem for one-rule semi-Thue system	2022-12-09	Paper
https://portal.mardi4nfdi.de/entity/Q5028483	2022-02-09	Paper
The isomorphism problem for finite extensions of free groups is in PSPACE	2021-07-28	Paper
An effective version of Stallings' theorem in the case of context-free groups	2019-03-29	Paper
The obstructions of a minor-closed set of graphs defined by hyperedge replacement can be constructed	2019-01-10	Paper
The equivalence problem for deterministic pushdown automata is decidable	2018-07-04	Paper
Equations over free inverse monoids with idempotent variables	2017-10-20	Paper
Equations over free inverse monoids with idempotent variables	2015-10-20	Paper
Bottom-up rewriting for words and terms	2014-09-11	Paper
Word-mappings of level 2	2014-03-25	Paper
LALBLC A Program Testing the Equivalence of dpda’s	2013-08-07	Paper
https://portal.mardi4nfdi.de/entity/Q5389154	2012-04-25	Paper
Tree Automata and Automata on Linear Orderings	2009-05-06	Paper
Sequences of Level 1, 2, 3,..., k,...	2008-06-03	Paper
RATIONAL SUBSETS IN HNN-EXTENSIONS AND AMALGAMATED PRODUCTS	2008-05-20	Paper
EQUATIONS IN FREE INVERSE MONOIDS	2008-05-14	Paper
Bottom-Up Rewriting Is Inverse Recognizability Preserving	2008-01-02	Paper
Theories of HNN-Extensions and Amalgamated Products	2007-09-11	Paper
When Is a Graph Product of Groups Virtually-Free?	2007-03-30	Paper
Iterated pushdown automata and sequences of rational numbers	2006-08-16	Paper
The Bisimulation Problem for Equational Graphs of Finite Out-Degree	2005-09-16	Paper
Decision problems for semi-Thue systems with a few rules	2005-02-22	Paper
https://portal.mardi4nfdi.de/entity/Q4818836	2004-09-24	Paper
https://portal.mardi4nfdi.de/entity/Q4737142	2004-08-11	Paper
https://portal.mardi4nfdi.de/entity/Q4453459	2004-03-07	Paper
https://portal.mardi4nfdi.de/entity/Q4449197	2004-02-08	Paper
\(L(A)=L(B)\)? A simplified decidability proof.	2002-07-15	Paper
https://portal.mardi4nfdi.de/entity/Q4529994	2002-05-07	Paper
\(L(A)=L(B)\)? decidability results from complete formal systems	2000-12-12	Paper
Complete formal systems for equivalence problems	2000-08-23	Paper
https://portal.mardi4nfdi.de/entity/Q4938651	2000-02-23	Paper
https://portal.mardi4nfdi.de/entity/Q4218106	1999-05-31	Paper
https://portal.mardi4nfdi.de/entity/Q4223071	1999-01-03	Paper
A polynomial algorithm testing partial confluence of basic semi-Thue systems	1998-08-13	Paper
The obstructions of a minor-closed set of graphs defined by a context-free grammar	1998-02-25	Paper
Some undecidable termination problems for semi-Thue systems	1997-02-28	Paper
On the rational subsets of the free group	1996-10-27	Paper
https://portal.mardi4nfdi.de/entity/Q4867142	1996-03-19	Paper
Some decision problems about controlled rewriting systems	1990-01-01	Paper
A characterisation of deterministic context-free languages by means of right-congruences	1990-01-01	Paper
Church-Rosser controlled rewriting systems and equivalence problems for deterministic context-free languages	1989-01-01	Paper
Groups and NTS languages	1987-01-01	Paper
The equivalence and inclusion problems for NTS languages	1985-01-01	Paper
NTS languages are deterministic and congruential	1985-01-01	Paper
Remarques sur les langages de parenthèses	1984-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3339311	1984-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3965569	1982-01-01	Paper
A new class of C.F.L. for which the equivalence is decidable	1981-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Géraud Sénizergues