Name
Abstract | ||
|---|---|---|
This paper puts forward a data model based on pointed unranked trees labelled with arbitrary strings. An abstract transformation machine for this data model is presented that combines rule-driven processing with a very simple query mechanism. This machine is shown to be able to express any computable tree transformation. This suggests that the rule-driven processing principle is a powerful tool even when it is used in conjunction with a simple and weak query model. An implementation of this machine enhanced with regular expression-based query mechanism is discussed. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1016/S0920-5489(03)00068-0 | Computer Standards & Interfaces |
Keywords | Field | DocType |
Tree-structured data,Pointed tree,Transducer,Tree walking,Regular expression | Tree traversal,Computer science,K-ary tree,Tree (data structure),Metric tree,Algorithm,Theoretical computer science,Tree structure,Incremental decision tree,Interval tree,Search tree | Journal |
Volume | Issue | ISSN |
25 | 5 | 0920-5489 |
Citations | PageRank | References |
1 | 0.41 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nikita Schmidt | 1 | 335 | 18.25 |
| Ahmed Patel | 2 | 167 | 23.33 |