Unranked Tree Rewriting and Effective Closures of Languages

Florent Jacquemard 1, 2 Michaël Rusinowitch 3
1 Repmus - Représentations musicales
STMS - Sciences et Technologies de la Musique et du Son
2 MuTant - Synchronous Realtime Processing and Programming of Music Signals
Inria Paris-Rocquencourt, UPMC - Université Pierre et Marie Curie - Paris 6, IRCAM, CNRS - Centre National de la Recherche Scientifique
3 CASSIS - Combination of approaches to the security of infinite states systems
FEMTO-ST - Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174), Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
Abstract : 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.
Complete list of metadatas

https://hal.inria.fr/hal-00852379
Contributor : Florent Jacquemard <>
Submitted on : Tuesday, August 20, 2013 - 6:14:52 PM
Last modification on : Thursday, March 21, 2019 - 1:09:19 PM
Long-term archiving on : Wednesday, April 5, 2017 - 10:47:10 PM

Files

Identifiers

  • HAL Id : hal-00852379, version 1

Citation

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⟩

Share

Metrics

Record views

532

Files downloads

176