首页 | 本学科首页   官方微博 | 高级检索  
     检索      

内-递推信息与内-递推二叉树特征-辨识
引用本文:李豫颖,林宏康.内-递推信息与内-递推二叉树特征-辨识[J].山东大学学报(理学版),2012,47(8):86-91,102.
作者姓名:李豫颖  林宏康
作者单位:宁德师范学院计算机系,福建宁德352100 山东大学数学学院,山东济南250100
基金项目:国家自然科学基金资助项目(71171055);福建省自然科学基金资助项目(2011J01357);宁德师范学院服务海西重点资助项目(2011H307,2010H202)
摘    要:引入树结构于内-递推信息的递推结构中,提出内-递推二叉树概念,获得内-递推二叉树的结构与特性。定义了内-递推二叉树的内-递推度与递推损失度;给出内-递推二叉树存在性定理、满二叉树存在与惟一性定理、完全二叉树定理,包括内-递推二叉树结点的辨识定理与辨识准则。内-递推二叉树是内-递推信息的一种重要组织结构,内-递推二叉树的研究过程与结果,为具有内-递推特性的信息处理提供了一种新方法。

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

Inward-recursion information and characteristics-identification of inward-recursion binary tree
LI Yu-ying,LIN Hong-kang.Inward-recursion information and characteristics-identification of inward-recursion binary tree[J].Journal of Shandong University,2012,47(8):86-91,102.
Authors:LI Yu-ying  LIN Hong-kang
Institution:1,2(1.Department of Computer,Ningde Normal University,Ningde 352100,Fujian,China; 2.School of Mathematics,Shandong University,Jinan 250100,Shandong,China)
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.
Keywords:P-sets  inward-recursion information  inward-recursion binary tree  inward-recursion degree  identification
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号