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

Rewrite Closure and CF Hedge Automata


We introduce an extension of hedge automata called bidimensional context-free hedge automata, proposing a new uniform representation of vertical and horizontal computation steps in unranked ordered trees. The class recognized languages 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 (356.28 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00752496 , version 1 (15-11-2012)
hal-00752496 , version 2 (16-11-2012)


  • HAL Id : hal-00752496 , version 2


Florent Jacquemard, Michaël Rusinowitch. Rewrite Closure and CF Hedge Automata. 2012. ⟨hal-00752496v2⟩
275 View
422 Download


Gmail Facebook Twitter LinkedIn More