内-递推信息与内-递推二叉树特征-辨识  

Inward-recursion information and characteristics-identification of inward-recursion binary tree

作　　者：李豫颖[1,2] 林宏康[1,2] 

机构地区：[1]宁德师范学院计算机系,福建宁德352100 [2]山东大学数学学院,山东济南250100

出　　处：《山东大学学报（理学版）》2012年第8期86-91,102,共7页Journal of Shandong University(Natural Science)

基　　金：国家自然科学基金资助项目(71171055);福建省自然科学基金资助项目(2011J01357);宁德师范学院服务海西重点资助项目(2011H307,2010H202)

摘　　要：引入树结构于内-递推信息的递推结构中,提出内-递推二叉树概念,获得内-递推二叉树的结构与特性。定义了内-递推二叉树的内-递推度与递推损失度;给出内-递推二叉树存在性定理、满二叉树存在与惟一性定理、完全二叉树定理,包括内-递推二叉树结点的辨识定理与辨识准则。内-递推二叉树是内-递推信息的一种重要组织结构,内-递推二叉树的研究过程与结果,为具有内-递推特性的信息处理提供了一种新方法。Introducing the structure of tree into the recursion structure of the inward-recursion information, the concept of inward-recursion binary tree is proposed. The structure and the characteristics of the tree are obtained. Also, the inward- recursion degree and the recursive loss degree are defined. The existence theorem of the inward-fecursion binary tree, the existence and uniqueness theorem of the full binary tree for the inward-recursion binary tree, the theorem of the complete binary tree for the inward-recursion binary tree are given, including the identification theorems and the identifi- cation criterion of nodes for the inward-recursion binary tree. The inward-recursion binary tree is an important organiza- tion structure for the inward-recursion information. The research way and results provide a new method for information processing which has the characteristics of inward-recursion.

关 键 词：P-集合 内-递推信息 内-递推二叉树 内-递推度 辨识 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]