| Decision problems for semi-Thue systems with a few rules Y Matiyasevich, G Sénizergues Theoretical Computer Science 330 (1), 145-169, 2005 | 180 | 2005 |
| L (A)= L (B)? decidability results from complete formal systems G Sénizergues Theoretical computer science 251 (1-2), 1-166, 2001 | 170 | 2001 |
| The equivalence problem for deterministic pushdown automata is decidable G Sénizergues Automata, Languages and Programming: 24th International Colloquium, ICALP'97 …, 1997 | 152 | 1997 |
| Decidability of bisimulation equivalence for equational graphs of finite out-degree G Sénizergues Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat …, 1998 | 77 | 1998 |
| L (A)= L (B)? a simplified decidability proof G Sénizergues Theoretical Computer Science 281 (1-2), 555-608, 2002 | 62 | 2002 |
| The equivalence and inclusion problems for NTS languages G Sénizergues Journal of Computer and System Sciences 31 (3), 303-331, 1985 | 48 | 1985 |
| The bisimulation problem for equational graphs of finite out-degree G Sénizergues SIAM Journal on Computing 34 (5), 1025-1106, 2005 | 45 | 2005 |
| NTS languages are deterministic and congruential L Boasson, G Sénizergues Journal of Computer and System Sciences 31 (3), 332-342, 1985 | 45 | 1985 |
| Groups and NTS languages JM Autebert, L Boasson, G Sénizergues Journal of Computer and System Sciences 35 (2), 243-267, 1987 | 41 | 1987 |
| On the termination problem for one-rule semi-thue system G Sénizergues Rewriting Techniques and Applications: 7th International Conference, RTA-96 …, 1996 | 31 | 1996 |
| Iterated pushdown automata and sequences of rational numbers S Fratani, G Sénizergues Annals of pure and applied logic 141 (3), 363-411, 2006 | 29 | 2006 |
| Theories of HNN-extensions and amalgamated products M Lohrey, G Sénizergues International Colloquium on Automata, Languages, and Programming, 504-515, 2006 | 28 | 2006 |
| Some decision problems about controlled rewriting systems G Sénizergues Theoretical computer science 71 (3), 281-346, 1990 | 25 | 1990 |
| Formal languages & word-rewriting G Sénizergues French School on Theoretical Computer Science, 75-94, 1993 | 22 | 1993 |
| Word-mappings of level 2 J Ferté, N Marin, G Sénizergues Theory of Computing Systems 54, 111-148, 2014 | 21 | 2014 |
| Bottom-up rewriting is inverse recognizability preserving I Durand, G Sénizergues International Conference on Rewriting Techniques and Applications, 107-121, 2007 | 21 | 2007 |
| The Equivalence Problem for t-Turn DPDA Is Co-NP G Sénizergues Automata, Languages and Programming: 30th International Colloquium, ICALP …, 2003 | 21 | 2003 |
| When is a graph product of groups virtually-free? M Lohrey, G Sénizergues Communications in Algebra® 35 (2), 617-621, 2007 | 20 | 2007 |
| Sequences of Level 1, 2, 3,..., k,... G Sénizergues Computer Science–Theory and Applications: Second International Symposium on …, 2007 | 20 | 2007 |
| Definability in weak monadic second-order logic of some infinite graphs G Sénizergues Dagstuhl seminar on Automata theory: Infinite computations, Warden, Germany …, 1992 | 20 | 1992 |
