S
Sophie Tison
Researcher at Laboratoire d'Informatique Fondamentale de Lille
Publications - 66
Citations - 2860
Sophie Tison is an academic researcher from Laboratoire d'Informatique Fondamentale de Lille. The author has contributed to research in topics: Decidability & Tree automaton. The author has an hindex of 20, co-authored 66 publications receiving 2812 citations. Previous affiliations of Sophie Tison include French Institute for Research in Computer Science and Automation & university of lille.
Papers
More filters
Book
Tree Automata Techniques and Applications
Hubert Comon,Max Dauchet,Rémi Gilleron,Florent Jacquemard,Denis Lugiez,Christof Löding,Sophie Tison,Marc Tommasi +7 more
TL;DR: The goal of this book is to provide a textbook which presents the basics ofTree automata and several variants of tree automata which have been devised for applications in the aforementioned domains.
Proceedings ArticleDOI
The theory of ground rewrite systems is decidable
Max Dauchet,Sophie Tison +1 more
TL;DR: Using tree automata techniques, it is proven that the theory of ground rewrite systems is decidable and novel decision procedures are presented for most classic properties of ground rewriting systems.
Book ChapterDOI
Equality and Disequality Constraints on Direct Subterms in Tree Automata
Bruno Bogaert,Sophie Tison +1 more
TL;DR: A family is obtained which has good closure and decidability properties and some applications are given and an extension of tree automata is defined by adding some tests in the rules.
Journal ArticleDOI
Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems
TL;DR: This paper proves the confluence is decidable for ground term rewrite systems following a conjecture made by Huet and Oppen in their survey and an algorithm is proposed based on tree automata and tree transducers.
Journal ArticleDOI
Regular Tree Languages And Rewrite Systems
Rémy Gilleron,Sophie Tison +1 more
TL;DR: The undecidability of the preservation of regularity by rewrite systems is proved and fragments of the theory of ground term algebras modulo congruence generated by a set of equations which can be compiled in a terminating, confluent rewrite system which preserves regularity are studied.