Recherche

Recherche simple

Recherche avancée

Panier électronique

Votre panier ne contient aucune notice

Connexion à la base

Identification

(Identifiez-vous pour accéder aux fonctions de mise à jour. Utilisez votre login-password de courrier électronique)

Entrepôt OAI-PMH

Soumettre une requête

	Consulter la notice détaillée
	Version complète en ligne
	Version complète en ligne accessible uniquement depuis l'Ircam
	Ajouter la notice au panier
	Retirer la notice du panier

English version

(full translation not yet available)

Liste complète des articles

Consultation des notices

Vue détaillée

Vue Refer

Vue Labintel

Vue BibTeX

%0 Conference Proceedings
%A Jacquemard, Florent
%A Rusinowitch, Michaël
%T Unranked tree rewriting and effective closures of languages
%D 2013
%B Meeting of the IFIP WG 1.6 on Term Rewriting
%C Eindhoven
%F Jacquemard13b
%X We consider rewriting systems for unranked ordered trees, where the number of children 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, applications to static type checking for XML transformations and to the verification of read/write access control policies for XML updates are mentioned. (Invited Talk)
%1 7
%2 1