`Travelled to:`

1 × Czech Republic

1 × France

1 × Spain

1 × Sweden

1 × The Netherlands

1 × United Kingdom

2 × Canada

2 × Germany

2 × Italy

3 × USA

`Collaborated with:`

∅ I.Durand P.Henry M.Lohrey Y.Matiyasevich B.Courcelle M.Sylvestre

`Talks about:`

system (6) problem (5) semi (5) thue (4) equival (3) termin (3) context (2) rewrit (2) group (2) graph (2)

## Person: Géraud Sénizergues

### DBLP: S=eacute=nizergues:G=eacute=raud

### Contributed to:

### Wrote 15 papers:

- CIAA-2013-HenryS #equivalence #testing
- LALBLC A Program Testing the Equivalence of dpda’s (PH, GS), pp. 169–180.
- RTA-2010-DurandSS #bound #linear #term rewriting #termination
- Termination of linear bounded term rewriting systems (ID, GS, MS), pp. 341–356.
- RTA-2007-DurandS #bottom-up
- Bottom-Up Rewriting Is Inverse Recognizability Preserving (ID, GS), pp. 107–121.
- ICALP-v2-2006-LohreyS
- Theories of HNN-Extensions and Amalgamated Products (ML, GS), pp. 504–515.
- ICALP-2003-Senizergues #equivalence #problem
- The Equivalence Problem for t-Turn DPDA Is Co-NP (GS), pp. 478–489.
- ICALP-2002-Senizergues #decidability
- L(A) = L(B)? Decidability Results from Complete Formal Systems (GS), p. 37.
- ICALP-1999-Senizergues #question
- T(A) = T(B)? (GS), pp. 665–675.
- ICALP-1997-Senizergues #automaton #decidability #equivalence #problem
- The Equivalence Problem for Deterministic Pushdown Automata is Decidable (GS), pp. 671–681.
- ICALP-1996-Senizergues #graph
- Semi-Groups Acting on Context-Free Graphs (GS), pp. 206–218.
- LICS-1996-MatiyasevichS #problem
- Decision Problems for Semi-Thue Systems with a Few Rules (YM, GS), pp. 523–531.
- RTA-1996-Senizergues #on the #problem #termination
- On the Termination Problem for One-Rule Semi-Thue System (GS), pp. 302–316.
- RTA-1995-Senizergues #algorithm #confluence #polynomial #testing
- A Polynomial Algorithm Testing Partial Confluence of Basic Semi-Thue Systems (GS), pp. 194–209.
- TAGT-1994-CourcelleS #graph #set
- The Obstructions of a Minor-Closed Set of Graphs Defined by Hyperedge Replacement can be Constructed (BC, GS), pp. 351–367.
- ICALP-1993-Senizergues #effectiveness #theorem
- An Effective Version of Stallings’ Theorem in the Case of Context-Free Groups (GS), pp. 478–495.
- RTA-1993-Senizergues #decidability #problem #termination
- Some Undecidable Termination Problems for Semi-Thue Systems (GS), p. 434.