INFORMATION FLOW OF TREE (2) Tree Flow Equations

This paper is the second part of Information Flow of Tree. In the first part we put emphasis on two most essential streams of information on tree, that is, characteristic information flow and equivalent characteristic information flow _θκ(F°), thus established the correlation between information.The purpose of this paper is to express the transforming characteristics when these information is flowing through the tree, i. e. to establish the so-called tree flow equations. These equations describe the transmit relation of information between root and leave. The major sections consist of 1) leave vector set; 2) principle of odd-even transformation and 3) tree flow, equations.     

TREES MAPPING PRINCIPLE

This papar exploits a number of problems associated with the trees mapping, has put forward a universal set of the tree data structure defined on an arbitrary finite integeral domain and has studied the character of the set which will be studied further in [5].For the first time. it advences a mathematical expression on trees, and on the basis of the expression, has more deeply studied the boundary character for a trees mapping, So that an analytic expression on a geometric parameter pair (p. w) has been established.In the last section, this papar has established a more general expanding relation on the data structure and defined a number of important ideas associated with data elements, So that it has profoundly exposed the structure character on trees.     

TREE DATA STRUCTURE

It is the main aim in this papar to establish isomorphic relation between an equibottom tree class and an integeral sequence,and to study emphatically the expanding process of a tree and the iterative algorithm on the tree data.     

INFORMATION FLOW OF TREE (1) Tree Flow Theorems

This paper is divided into two parts, where the general regularities of information flow in the tree graph are discussed. In the first part we discuss the equivalent theorems of the tree flow, the main sections are as follows: 1. fundamental definitions; 2. equivalent mapping structure; 3. equivalent partition of vector set*; 4. theorems of tree flow. And in the second part we put stress on the establishment of tree flow equations.Here we present two most essential streams of information flowing in the tree, i.e. characteristic information flow F* and equivalent characteristic information flow *θ~κ (?), therefore the interior relation in tree flow is explicited.The main conclusions in this paper are centralized in three theorems, they are respectively called tree flow theorem, tree flow theorem A and tree flow theorem B. The first theorem describes the equivalent partition of tree flow and the latter theorems then describe the equations of tree flow. The basis of establishing these theorems is just th     

层次结构中封闭子图的映射

在[3]中,我们就层次结构(BS)中,任意一个封闭子图G_(5)∈G_(5)真的扩展,建立了其边界映射的三原则,并在这些原则的基础上,构造了该映射的表达式。本文,进一步按映射三原则扩展这一映射表达式,并使之一般化。最后,我们还建立了封闭子图G_(5)映射定理,说明了如果映射存在则G_(5)的映射像ε(G_(5))就可以构造而得。     

STRUCTURE OF COMPUTATIVE TREE FOR COMPUTABLE FUNCTION

In this paper, we study the computative Structure of computable function——a structure of computative tree, and, by analysis on it, got the most general algorithm and model for computation on computable functions.     

字集的识别模型

在[2]中，讨论了符号字表达式的归约问题．在字归约定理的基础上，该文将研究字集X5的归约结构及其识别模型．     

树数据结构

本文的目的在于建立等底树族和整数序列的同构关系,并着重于研究根树的展开过程和树数据结构的迭代算法。 在[2],C.C.ELGOT等人讨论了根树的代数结构,建立了树展开的同构关系,正如该文所叙述的,每个计算过程就是一个树的具体结构,本文建立了树结构的形式参量,即所谓树数据结构,ST. 下面两个图     

REDUCTION OF HIERARCHICAL STRUCTURE

In this paper, we've studied distributing characteristic of the paths in these graphs, put forward an idea of the nested rule on path distribution, and established a lat ice algebric structure of a covering of intervals. On the basis of this, we've established the partition theory and a reducible model of hierarchical structure.     

层次结构区间定理

在[1]中,我们讨论了层次结构(HS)在区间套的基础上的归约模型。在这里我们进一步探讨HS的区间结构特征,并在此基础上,讨论HS的封闭子图G_S的结构及其在HS中的退换,从而把一个HS通过退换映射退化成一个更简单的HS。