Name
Abstract | ||
|---|---|---|
We introduce F-structures and investigate interpretations of trees in F-structures. Thus trees are viewed as schemes of computations in F-structures. Every tree is shown to be strongly equivalent to some chain-free tree. This enables us to use the grammatical codings of [2] to define formulas for arbitrary interpreted trees. We also introduce a syntactic way to compute the values of interpreted trees. |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1007/BF01195201 | Mathematical Systems Theory |
Keywords | Field | DocType |
Computational Mathematic,Grammatical Codings | Discrete mathematics,Combinatorics,Metric tree,Weight-balanced tree,Ternary search tree,Syntax,Mathematics,Semantics,Computation | Journal |
Volume | Issue | ISSN |
27 | 2 | 0025-5661 |
Citations | PageRank | References |
1 | 0.40 | 2 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| A. Ehrenfeucht | 1 | 1823 | 497.83 |
| G. Rozenberg | 2 | 396 | 45.34 |
| K. Salomaa | 3 | 9 | 1.58 |