Closure of Hedge-Automata Languages by Hedge Rewriting

BOOK CHAPTER published in Rewriting Techniques and Applications

Authors: Florent Jacquemard | Michael Rusinowitch

Sequentiality, second order monadic logic and tree automata

PROCEEDINGS ARTICLE published in Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science

Authors: H. Comon

Rewriting and tree automata

BOOK CHAPTER published 1995 in Term Rewriting

Authors: Max Dauchet

Automated Induction with Constrained Tree Automata

BOOK CHAPTER published in Automated Reasoning

Authors: Adel Bouhoula | Florent Jacquemard

Encompassment properties and automata with constraints

BOOK CHAPTER published 1993 in Rewriting Techniques and Applications

Authors: Anne-Cécile Caron | Jean-Luc Coquide | Max Dauchet

Sequentiality, Monadic Second-Order Logic and Tree Automata

JOURNAL ARTICLE published February 2000 in Information and Computation

Authors: Hubert Comon

Ground reducibility is EXPTIME-complete

PROCEEDINGS ARTICLE published in Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science

Authors: H. Comon | F. Jacquemard

XML schema, tree logic and sheaves automata

JOURNAL ARTICLE published 10 October 2006 in Applicable Algebra in Engineering, Communication and Computing

Authors: Silvano Dal Zilio | Denis Lugiez

Tree Automata Help One To Solve Equational Formulae In AC-Theories

JOURNAL ARTICLE published October 1994 in Journal of Symbolic Computation

Authors: D. Lugiez | J.L. Moysset

Higher-order matching and tree automata

BOOK CHAPTER published 1998 in Computer Science Logic

Authors: Hubert Comon | Yan Jurski

Learning from Multiple Graphs Using a Sigmoid Kernel

PROCEEDINGS ARTICLE published December 2013 in 2013 12th International Conference on Machine Learning and Applications

Authors: Thomas Ricatte | Gemma Garriga | Remi Gilleron | Marc Tommasi

Ground reducibility is EXPTIME-complete

JOURNAL ARTICLE published November 2003 in Information and Computation

Authors: Hubert Comon | Florent Jacquemard

Rewrite Closure and CF Hedge Automata

BOOK CHAPTER published 2013 in Language and Automata Theory and Applications

Authors: Florent Jacquemard | Michael Rusinowitch

Tree automata with one memory set constraints and cryptographic protocols

JOURNAL ARTICLE published February 2005 in Theoretical Computer Science

Authors: Hubert Comon | Véronique Cortier

The Emptiness Problem for Tree Automata with Global Constraints

PROCEEDINGS ARTICLE published July 2010 in 2010 25th Annual IEEE Symposium on Logic in Computer Science

Authors: Luis Barguno | Carles Creus | Guillem Godoy | Florent Jacquemard | Camille Vacher

Deciding the Satisfiability of Quantifier Free Formulae on One-Step Rewriting

BOOK CHAPTER published 1999 in Rewriting Techniques and Applications

Authors: Anne-Cécile Caron | Franck Seynhaeve | Sophie Tison | Marc Tommasi

Some new decidability results on positive and negative set constraints

BOOK CHAPTER published 1994 in Constraints in Computational Logics

Authors: Rémi Gilleron | Sophie Tison | Marc Tommasi

Complement problems and tree automata in AC-like theories (extended abstract)

BOOK CHAPTER published 1993 in Lecture Notes in Computer Science

Authors: D. Lugiez | J. L. Moysset

Tree Automata with Equality Constraints Modulo Equational Theories

BOOK CHAPTER published 2006 in Automated Reasoning

Authors: Florent Jacquemard | Michael Rusinowitch | Laurent Vigneron

FO2(<,+1,~) on data trees, data tree automata and branching vector addition systems

JOURNAL ARTICLE published 26 April 2016 in Logical Methods in Computer Science

Authors: Florent Jacquemard | Luc Segoufin | Jerémie Dimino