Unranked Tree Rewriting and Effective Closures of Languages - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

Unranked Tree Rewriting and Effective Closures of Languages


We consider rewriting systems for unranked ordered trees, where the number of chil- dren of a node is not determined by its label, and is not a priori bounded. The rewriting systems are defined such that variables in the rewrite rules can be substituted by hedges (sequences of trees) instead of just trees. Consequently, this notion of rewriting subsumes both standard term rewriting and word rewriting. We present some properties of preservation for classes of unranked tree languages, including hedge automata languages and various context-free extensions. Finally, ap- plications to static type checking for XML transformations and to the verification of read/write access control policies for XML updates are mentioned.
Fichier principal
Vignette du fichier
abstract.pdf (44.11 Ko) Télécharger le fichier
TRSHA-IFIP.pdf (163.95 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Format : Other

Dates and versions

hal-00852379 , version 1 (20-08-2013)


  • HAL Id : hal-00852379 , version 1


Florent Jacquemard, Michaël Rusinowitch. Unranked Tree Rewriting and Effective Closures of Languages. Meeting of the IFIP WG 1.6 on Term Rewriting, Jun 2013, Eindhoven, Netherlands. ⟨hal-00852379⟩
232 View
101 Download


Gmail Facebook X LinkedIn More