Feature Automata and Recognizable Sets of Feature Trees (1993)
by
Joachim Niehren
,
Andreas Podelski
| Venue: | In TAPSOFT'93, pages 356--375. Springer-Verlag LNCS 668 |
| Citations: | 12 - 3 self |
BibTeX
@INPROCEEDINGS{Niehren93featureautomata,
author = {Joachim Niehren and Andreas Podelski},
title = {Feature Automata and Recognizable Sets of Feature Trees},
booktitle = {In TAPSOFT'93, pages 356--375. Springer-Verlag LNCS 668},
year = {1993},
pages = {356--375},
publisher = {Springer Verlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Feature trees generalize first-order trees whereby argument positions become keywords ("features") from an infinite symbol set F . 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 F accounts for dynamic record field updates.
