Closure of Tree Automata Languages under Innermost Rewriting

JOURNAL ARTICLE published April 2009 in Electronic Notes in Theoretical Computer Science

Authors: Adrià Gascón | Guillem Godoy | Florent Jacquemard

Learning Sequential Tree-to-Word Transducers

BOOK CHAPTER published 2014 in Language and Automata Theory and Applications

Authors: Grégoire Laurence | Aurélien Lemay | Joachim Niehren | Sławek Staworko | Marc Tommasi

Efficient inclusion checking for deterministic tree automata and XML Schemas

JOURNAL ARTICLE published November 2009 in Information and Computation

Authors: Jérôme Champavère | Rémi Gilleron | Aurélien Lemay | Joachim Niehren

Type inference using unification in computer algebra

BOOK CHAPTER published in Applicable Algebra, Error-Correcting Codes, Combinatorics and Computer Algebra

Authors: J. Calmet | H. Comon | D. Lugiez

The theory of ground rewrite systems is decidable

PROCEEDINGS ARTICLE published in [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science

Authors: M. Dauchet | S. Tison

Normalization of Sequential Top-Down Tree-to-Word Transducers

BOOK CHAPTER published 2011 in Language and Automata Theory and Applications

Authors: Grégoire Laurence | Aurélien Lemay | Joachim Niehren | Sławek Staworko | Marc Tommasi

Multitree automata that count

JOURNAL ARTICLE published March 2005 in Theoretical Computer Science

Authors: Denis Lugiez

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

Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories

JOURNAL ARTICLE published 2 April 2013 in Logical Methods in Computer Science

Authors: Luis Barguñó | Carles Creus | Guillem Godoy | Florent Jacquemard | Camille Vacher

Tree Automata with One Memory, Set Constraints, and Ping-Pong Protocols

BOOK CHAPTER published 2001 in Automata, Languages and Programming

Authors: Hubert Comon | Véronique Cortier | John Mitchell

Tree automata with equality constraints modulo equational theories

JOURNAL ARTICLE published April 2008 in The Journal of Logic and Algebraic Programming

Authors: Florent Jacquemard | Michael Rusinowitch | Laurent Vigneron

Basics on Tree Automata

BOOK CHAPTER published July 2012 in Modern Applications of Automata Theory

Authors: Christof Löding

On the Parallel Complexity of Tree Automata

BOOK CHAPTER published 2001 in Rewriting Techniques and Applications

Authors: Markus Lohrey

Equality and disequality constraints on direct subterms in tree automata

BOOK CHAPTER published 1992 in STACS 92

Authors: B. Bogaert | S. Tison

A rewrite-based type discipline for a subset of computer algebra

JOURNAL ARTICLE published April 1991 in Journal of Symbolic Computation

Authors: H. Comon | D. Lugiez | Ph. Schnoebelen

Decidability of confluence for ground term rewriting systems

BOOK CHAPTER published in Fundamentals of Computation Theory

Authors: M. Dauchet | S. Tison

Tree Automata for Non-linear Arithmetic

BOOK CHAPTER published in Rewriting Techniques and Applications

Authors: Naoki Kobayashi | Hitoshi Ohsaki

Tree Automata, (Dis-)Equality Constraints and Term Rewriting

BOOK CHAPTER published 2011 in Lecture Notes in Computer Science

Authors: Sophie Tison

On Recognizable Sets and Tree Automata

BOOK CHAPTER published 1989 in Algebraic Techniques

Authors: B. COURCELLE

N-Ary Queries by Tree Automata

BOOK CHAPTER published 2005 in Database Programming Languages

Authors: Joachim Niehren | Laurent Planque | Jean-Marc Talbot | Sophie Tison