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

J4 ›› 2012, Vol. 47 ›› Issue (8): 86-91.

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

李豫颖^{1, 2,} 林宏康^1,2

1. 宁德师范学院计算机系, 福建宁德 352100; 2. 山东大学数学学院, 山东济南 250100

收稿日期:2012-01-09 出版日期:2012-08-20 发布日期:2012-12-24
作者简介:李豫颖(1962- ),女,副教授,研究方向为信息系统理论与应用.Email:asszlyy@163.com
基金资助:
国家自然科学基金资助项目(71171055);福建省自然科学基金资助项目(2011J01357);宁德师范学院服务海西重点资助项目(2011H307, 2010H202)

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

LI Yu-ying^1,2, LIN Hong-kang^1,2

1. Department of Computer, Ningde Normal University, Ningde 352100, Fujian, China;
2. School of Mathematics, Shandong University, Jinan 250100, Shandong, China

Received:2012-01-09 Online:2012-08-20 Published:2012-12-24

摘要/Abstract

摘要：

引入树结构于内-递推信息的递推结构中,提出内-递推二叉树概念, 获得内-递推二叉树的结构与特性。定义了内-递推二叉树的内-递推度与递推损失度;给出内-递推二叉树存在性定理、满二叉树存在与惟一性定理、完全二叉树定理,包括内-递推二叉树结点的辨识定理与辨识准则。内-递推二叉树是内-递推信息的一种重要组织结构,内-递推二叉树的研究过程与结果,为具有内-递推特性的信息处理提供了一种新方法。

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

Abstract:

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-recursion 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 identification criterion of nodes for the inward-recursion binary tree. The inward-recursion binary tree is an important organization 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.

Key words: P-sets; inward-recursion information; inward-recursion binary tree; inward-recursion degree; identification

李豫颖1, 2, 林宏康1,2. 内-递推信息与内-递推二叉树特征-辨识[J]. J4, 2012, 47(8): 86-91.

LI Yu-ying1,2, LIN Hong-kang1,2. Inward-recursion information and characteristics-identification of inward-recursion binary tree[J]. J4, 2012, 47(8): 86-91.

参考文献

多维度评价

Viewed

Full text

Abstract

Cited

Shared

Discussed