Name
Abstract | ||
|---|---|---|
Abstract In this paper we present higher–order attributed tree transducers as a formal computational model for higher–order attribute grammars. The latter is a generalization of the classical concept of attribute grammars in the sense that during attribute evaluation, the input tree can be enlarged by inserting subtrees which were computed during attribute evaluation. We prove the universality of this formalism by showing that the class of functions described by higher–order attributed tree transducers coincides with the class of (partial) recursive tree functions. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1007/s002240010018 | Theory of Computing Systems / Mathematical Systems Theory |
Keywords | Field | DocType |
Normal Form,Computation Tree,Tree Function,Derivation Tree,Input Tree | Discrete mathematics,Combinatorics,L-attributed grammar,K-ary tree,Tree structure,Function tree,Universality (philosophy),Recursive tree,Mathematics,Computation tree,Attribute domain | Journal |
Volume | Issue | ISSN |
34 | 1 | 1432-4350 |
Citations | PageRank | References |
2 | 0.37 | 9 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Thomas Noll | 1 | 23 | 6.12 |
| Heiko Vogler | 2 | 612 | 43.44 |