Rewrite Closure and CF Hedge Automata - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

Rewrite Closure and CF Hedge Automata


We introduce an extension of hedge automata called bidimensional context-free hedge automata. The class of unranked ordered tree languages they recognize is shown to be preserved by rewrite closure with inverse-monadic rules. We also extend the parameterized rewriting rules used for modeling the W3C XQuery Update Facility in previous works, by the possibility to insert a new parent node above a given node. We show that the rewrite closure of hedge automata languages with these extended rewriting systems are context-free hedge languages.
Fichier principal
Vignette du fichier
CFHA.pdf (166.48 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00767719 , version 1 (20-12-2012)



Florent Jacquemard, Michael Rusinowitch. Rewrite Closure and CF Hedge Automata. 7th International Conference on Language and Automata Theory and Application, Apr 2013, Bilbao, Spain. ⟨hal-00767719⟩
229 View
157 Download



Gmail Facebook Twitter LinkedIn More