Name
Abstract | ||
|---|---|---|
We consider structured processes that compute changes of valuation functions defined for functional structures, where both the domain and range of each function are the set of sequences over a carrier set. By introducing consistency conditions and certain restrictions on the underlying graph, we obtain a determinism result guaranteeing that for each valuation the structured process computes a unique change of context, i.e., the process defines a partial function on the set of valuations. Employing the determinism theorem we obtain a decomposition result for interpreted trees using a structured process where the edges represent computations in the subtrees. |
Year | DOI | Venue |
|---|---|---|
1997 | 10.3233/FI-1997-29401 | Fundam. Inform. |
Keywords | Field | DocType |
functional structure,decomposition result,determinism result,partial function,consistency condition,certain restriction,determinism theorem,valuation function,structured process,nonsequential tree-based computation scheme,carrier set,nonsequential tree-based computation schemes | Discrete mathematics,Graph,Combinatorics,Determinism,Theoretical computer science,Valuation (finance),Mathematics,Semantics,Computation | Journal |
Volume | Issue | Citations |
29 | 4 | 0 |
PageRank | References | Authors |
0.34 | 5 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| A. Ehrenfeucht | 1 | 1823 | 497.83 |
| G. Rozenberg | 2 | 396 | 45.34 |
| K. Salomaa | 3 | 9 | 1.58 |