| 2009 |
|---|
| 44 | EE | Irène Durand,
Géraud Sénizergues:
Bottom-up rewriting for words and terms
CoRR abs/0903.2554: (2009) |
| 2008 |
|---|
| 43 | EE | Markus Lohrey,
Géraud Sénizergues:
Rational Subsets in HNN-Extensions and Amalgamated Products.
IJAC 18(1): 111-163 (2008) |
| 2007 |
|---|
| 42 | EE | Géraud Sénizergues:
Sequences of Level 1, 2, 3, ..., k , ...
CSR 2007: 24-32 |
| 41 | EE | Irène Durand,
Géraud Sénizergues:
Bottom-Up Rewriting Is Inverse Recognizability Preserving.
RTA 2007: 107-121 |
| 40 | EE | Timothy Deis,
John C. Meakin,
Géraud Sénizergues:
Equations in Free Inverse Monoids.
IJAC 17(4): 761-795 (2007) |
| 2006 |
|---|
| 39 | EE | Markus Lohrey,
Géraud Sénizergues:
Theories of HNN-Extensions and Amalgamated Products.
ICALP (2) 2006: 504-515 |
| 38 | EE | S. Fratani,
Géraud Sénizergues:
Iterated pushdown automata and sequences of rational numbers.
Ann. Pure Appl. Logic 141(3): 363-411 (2006) |
| 2005 |
|---|
| 37 | EE | Géraud Sénizergues:
The Bisimulation Problem for Equational Graphs of Finite Out-Degree.
SIAM J. Comput. 34(5): 1025-1106 (2005) |
| 36 | EE | Yuri Matiyasevich,
Géraud Sénizergues:
Decision problems for semi-Thue systems with a few rules.
Theor. Comput. Sci. 330(1): 145-169 (2005) |
| 2003 |
|---|
| 35 | EE | Géraud Sénizergues:
The Equivalence Problem for t-Turn DPDA Is Co-NP.
ICALP 2003: 478-489 |
| 2002 |
|---|
| 34 | EE | Géraud Sénizergues:
L(A) = L(B)? Decidability Results from Complete Formal Systems.
ICALP 2002: 37 |
| 33 | EE | Géraud Sénizergues:
L(A)=L(B)? A simplified decidability proof.
Theor. Comput. Sci. 281(1-2): 555-608 (2002) |
| 2001 |
|---|
| 32 | EE | Géraud Sénizergues:
Some Applications of the Decidability of DPDA's Equivalence.
MCU 2001: 114-132 |
| 31 | EE | Géraud Sénizergues:
L(A)=L(B)? decidability results from complete formal systems.
Theor. Comput. Sci. 251(1-2): 1-166 (2001) |
| 2000 |
|---|
| 30 | EE | Géraud Sénizergues:
The Bisimulation Problem for equational graphs of finite out-degree
CoRR cs.LO/0008018: (2000) |
| 29 | EE | Géraud Sénizergues:
Complete formal systems for equivalence problems.
Theor. Comput. Sci. 231(2): 309-334 (2000) |
| 1999 |
|---|
| 28 | EE | Géraud Sénizergues:
T(A) = T(B)?
ICALP 1999: 665-675 |
| 1998 |
|---|
| 27 | EE | Géraud Sénizergues:
Decidability of Bisimulation Equivalence for Equational Graphs of Finite Out-Degree.
FOCS 1998: 120-129 |
| 26 | | Géraud Sénizergues:
Complete Formal Systems for Equivalence Problems.
MCU (1) 1998: 22-49 |
| 25 | EE | Géraud Sénizergues:
The Equivalence Problem for Deterministic Pushdown Transducers into Abelian Groups.
MFCS 1998: 305-315 |
| 24 | EE | Bruno Courcelle,
Géraud Sénizergues:
The obstructions of a minor-closed set of graphs defined by a context-free grammar.
Discrete Mathematics 182(1-3): 29-51 (1998) |
| 23 | EE | Géraud Sénizergues:
A Polynomial Algorithm Testing Partial Confluence of Basic Semi-Thue Systems.
Theor. Comput. Sci. 192(1): 55-75 (1998) |
| 1997 |
|---|
| 22 | | Géraud Sénizergues:
The Equivalence Problem for Deterministic Pushdown Automata is Decidable.
ICALP 1997: 671-681 |
| 21 | EE | Géraud Sénizergues:
L(A) = L(B)?
Electr. Notes Theor. Comput. Sci. 9: (1997) |
| 1996 |
|---|
| 20 | | Géraud Sénizergues:
Semi-Groups Acting on Context-Free Graphs.
ICALP 1996: 206-218 |
| 19 | | Yuri Matiyasevich,
Géraud Sénizergues:
Decision Problems for Semi-Thue Systems with a Few Rules.
LICS 1996: 523-531 |
| 18 | | Géraud Sénizergues:
On the Termination Problem for One-Rule Semi-Thue System.
RTA 1996: 302-316 |
| 17 | | Géraud Sénizergues:
On the Rational Subsets of the Free Group.
Acta Inf. 33(3): 281-296 (1996) |
| 1995 |
|---|
| 16 | | Géraud Sénizergues:
A Polynomial Algorithm Testing Partial Confluence of Basic Semi-Thue Systems.
RTA 1995: 194-209 |
| 15 | EE | Géraud Sénizergues:
Some Undecidable Termination Problems for Semi-Thue Systems.
Theor. Comput. Sci. 142(2): 257-276 (1995) |
| 1994 |
|---|
| 14 | | 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 |
|---|
| 13 | | Géraud Sénizergues:
An Effective Version of Stallings' Theorem in the Case of Context-Free Groups.
ICALP 1993: 478-495 |
| 12 | | Géraud Sénizergues:
Some Undecidable Termination Problems for Semi-Thue Systems (Abstract).
RTA 1993: 434 |
| 11 | | Géraud Sénizergues:
Formal Languages and Word-Rewriting.
Term Rewriting 1993: 75-94 |
| 1990 |
|---|
| 10 | | Géraud Sénizergues:
A Characterisation of Deterministic Context-Free Languages by Means of Right-Congruences.
Theor. Comput. Sci. 70(2): 213-232 (1990) |
| 9 | | Géraud Sénizergues:
Some Decision Problems about Controlled Rewriting Systems.
Theor. Comput. Sci. 71(3): 281-346 (1990) |
| 1989 |
|---|
| 8 | | 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 |
|---|
| 7 | | Jean-Michel Autebert,
Luc Boasson,
Géraud Sénizergues:
Groups and NTS Languages.
J. Comput. Syst. Sci. 35(2): 243-267 (1987) |
| 1985 |
|---|
| 6 | | Géraud Sénizergues:
The Equivalence and Inclusion Problems for NTS Languages.
J. Comput. Syst. Sci. 31(3): 303-331 (1985) |
| 5 | | Luc Boasson,
Géraud Sénizergues:
NTS Languages Are Deterministic and Congruential.
J. Comput. Syst. Sci. 31(3): 332-342 (1985) |
| 1984 |
|---|
| 4 | | Jean-Michel Autebert,
Luc Boasson,
Géraud Sénizergues:
Langages de Parenthèses, Langages N.T.S. et Homomorphismes Inverses.
ITA 18(4): 327-344 (1984) |
| 3 | | 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 |
|---|
| 2 | | Géraud Sénizergues:
The equivalence problem for N.T.S. languages is decidable.
Theoretical Computer Science 1983: 313-323 |
| 1981 |
|---|
| 1 | | 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) |
