| HAL-Inria | Les publications, logiciels... des scientifiques Inria |
Communication dans un congrès
Feature Automata and Recognizable Sets of Feature Trees
Abstract : Feature trees generalize first-order trees whereby argument positions become keywords (features) from an infinite symbol set . Constructor symbols can occur with any argument positions, in any finite number. Feature trees are used to model flexible records; the assumption on the infiniteness of accounts for dynamic record field updates. We develop a universal algebra framework for feature trees. We introduce the classical set-defining notions: automata, regular expressions and equational systems, and show that they coincide. This extension of the regular theory of trees requires new notions and proofs. Roughly, a feature automaton reads a feature tree in two directions: along its branches and along the fan-out of each node. We illustrate the practical motivation of our regular theory of feature trees by pointing out an application on the programming language LIFE.
Littérature citée [18 références]
https://hal.inria.fr/inria-00536823
Contributeur : Joachim Niehren <>
Soumis le : mardi 16 novembre 2010 - 23:11:57
Dernière modification le : jeudi 20 septembre 2018 - 07:54:02
Document(s) archivé(s) le : jeudi 17 février 2011 - 03:17:06
Contributeur : Joachim Niehren <>
Soumis le : mardi 16 novembre 2010 - 23:11:57
Dernière modification le : jeudi 20 septembre 2018 - 07:54:02
Document(s) archivé(s) le : jeudi 17 février 2011 - 03:17:06
Fichiers
CAAP1993.pdf
Fichiers produits par l'(les) auteur(s)