Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Réty, Pierre - Laboratoire d'Informatique Fondamentale d'Orléans, Université d'Orléans
Weakly Regular Relations and Applications S ebastien Limet , Pierre R ety , Helmut Seidl +
Synchronized Tree Languages Revisited
Weak Inclusion for XML Types (full version)
Tree Automata for Rewrite Strategies Pierre Rety Julie Vuotto
Minimal tree language extensions: a keystone of XML type compatibility and evolution
Weak Inclusion for XML Types Joshua Amavi, Jacques Chabin, Mirian Halfeld Ferrari, and Pierre Rety
Minimal Extensions of Tree Languages
A New Result about the Decidability of the
Weakly Regular Relations and
ContextFree Tree languages for Descendants Pierre Rety and Julie Vuotto
TTSLI : an Implementation of Tree-Tuple Synchronized Languages
Universit e d'Orl eans Habilitation a diriger les recherches
Regular Sets of Descendants by some Rewrite Strategies
Regular Sets of Descendants by
Electronic Notes in Theoretical Computer Science 70 No. 6 (2002) URL: http://www.elsevier.nl/locate/entcs/volume70.html 20 pages
ContextFree Tree languages for
Regular Sets of Descendants by some
Demanddriven Search in Functional Logic Programs Michael Hanus \Lambda
Regular Sets of Descendants for Constructor-based Rewrite Systems
A New Result about the Decidability of the Existential OneStep Rewriting Theory ?
Regular Sets of Descendants by Leftmost Strategy
