On the Algebraic Atructure of Rooted Trees
暂无分享,去创建一个
Figure 1.1 Figure 1.2 These two digraphs, while different, usually represent the same phenomenon, say, the same “computational process.” Our interest in rooted trees stems from the fact that these two digraphs “unfold” into the SAME infinite tree. In some cases at least it is also true that different (i.e. non-isomorphic) trees represent different phenomena (of the same kind). In these cases the unfoldings (i.e. the trees) are surrogates for the phenomena.
[1] Stephen L. Bloom,et al. The Existence and Construction of Free Iterative Theories , 1976, J. Comput. Syst. Sci..
[2] E. Engeler. Symposium on Semantics of Algorithmic Languages , 1971, Symposium on Semantics of Algorithmic Languages.