| Tree automata techniques and applications H Comon, M Dauchet, R Gilleron, F Jacquemard, D Lugiez, C Löding, ... | 1702 | 2008 |
| Tree automata techniques and applications (2007) H Comon, M Dauchet, R Gilleron, F Jacquemard, D Lugiez, S Tison, ... | 441 | 2007 |
| The theory of ground rewrite systems is decidable M Dauchet, S Tison [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science …, 1990 | 251 | 1990 |
| Equality and disequality constraints on direct subterms in tree automata B Bogaert, S Tison STACS 92: 9th Annual Symposium on Theoretical Aspects of Computer Science …, 1992 | 177 | 1992 |
| Regular tree languages and rewrite systems R Gilleron, S Tison Fundamenta informaticae 24 (1-2), 157-175, 1995 | 129 | 1995 |
| Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems M Dauchet, T Heuillard, P Lescanne, S Tison Information and Computation 88 (2), 187-201, 1990 | 118 | 1990 |
| Solving systems of set constraints with negated subset relationships R Gilleron, S Tison, M Tommasi Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science, 372-380, 1993 | 88 | 1993 |
| Decidability of confluence for ground term rewriting systems M Dauchet, S Tison International Conference on Fundamentals of Computation Theory, 80-89, 1985 | 82 | 1985 |
| Solving systems of set constraints using tree automata R Gilleron, S Tison, M Tommasi Annual Symposium on Theoretical Aspects of Computer Science, 505-514, 1993 | 77 | 1993 |
| N-ary queries by tree automata J Niehren, L Planque, JM Talbot, S Tison Database Programming Languages: 10th International Workshop, DBPL 2005 …, 2005 | 46 | 2005 |
| Solving classes of set constraints with tree automata P Devienne, JM Talbot, S Tison International Conference on Principles and Practice of Constraint …, 1997 | 45 | 1997 |
| Tree automata with global constraints E Filiot, JM Talbot, S Tison International Conference on Developments in Language Theory, 314-326, 2008 | 43 | 2008 |
| Set constraints and automata R Gilleron, S Tison, M Tommasi Information and Computation 149 (1), 1-41, 1999 | 41 | 1999 |
| Earliest query answering for deterministic nested word automata O Gauwin, J Niehren, S Tison International Symposium on Fundamentals of Computation Theory, 121-132, 2009 | 32 | 2009 |
| Set-based analysis for logic programming and tree automata JM Talbot, S Tison, P Devienne Static Analysis: 4th International Symposium, SAS'97 Paris, France …, 1997 | 28 | 1997 |
| Satisfiability of a spatial logic with tree variables E Filiot, JM Talbot, S Tison International Workshop on Computer Science Logic, 130-145, 2007 | 27 | 2007 |
| Tree automata with global constraints E Filiot, JM Talbot, S Tison International Journal of Foundations of Computer Science 21 (04), 571-596, 2010 | 26 | 2010 |
| BHDL: Circuit design in B A Aljer, P Devienne, S Tison, JL Boulanger, G Mariano Third International Conference on Application of Concurrency to System …, 2003 | 24 | 2003 |
| Some new decidability results on positive and negative set constraints R Gilleron, S Tison, M Tommasi International Conference on Constraints in Computational Logics, 336-351, 1994 | 24 | 1994 |
| Fair termination is decidable for ground systems S Tison Rewriting Techniques and Applications: 3rd International Conference, RTA-89 …, 1989 | 24 | 1989 |
