Catégorie de document |
Contribution à un colloque ou à un congrès |
Titre |
Rewrite Closure and CF Hedge Automata |
Auteur principal |
Florent Jacquemard |
Co-auteur |
Michael Rusinowitch |
Colloque / congrès |
7th International Conference on Language and Automata Theory and Application (LATA). Bilbao : 2013 |
Comité de lecture |
Oui |
Volume |
Lecture Notes in Computer Scie |
Copyright |
Springer |
Année |
2013 |
Statut éditorial |
Non publié |
Résumé |
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. |
Equipe |
Représentations musicales |
Cote |
Jacquemard13a |
Adresse de la version en ligne |
http://architexte.ircam.fr/textes/Jacquemard13a/index.pdf |
|