• 主题
高级搜索  >
历史搜索 清空历史
首页> 美国政府科技报告 >Counting Binary, Rooted Trees Arboreal Numbers of the First and Second Kind. Ii. A Recursive Formula for Counting N-Ary Rooted Trees
【24h】

Counting Binary, Rooted Trees Arboreal Numbers of the First and Second Kind. Ii. A Recursive Formula for Counting N-Ary Rooted Trees

机译：计算第一类和第二类树的二元树，根树数。二。计算N元根树的递推公式

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The report is in two parts. The first part, that considers counting binary rooted trees, examined the question of how many distinct functions of n inputs can be realized by varying the connection pattern in a network of two-input elements. In assuming free interconnectability of elements, it is implied that all input and output signals in the network lie in the same domain. Accordingly, all functions computed by network elements can be treated as equivalent to binary operations in this domain, and vice versa. The numbers of functionally distinct binary rooted trees, computed vs. the number of terminals, for each of three function classes, and the arboreal numbers of the second kind for n up to 40 are tabulated. In the second part, a recursive formula is derived for counting n-ary rooted trees. Formulas are given for counting the number of unlabeled rooted trees of k vertices, the number of unlabeled binary trees of k vertices, the number of unlabeled n-ary rooted trees as a function of the number of terminal vertices rather than the total number of vertices, and the number of unlabeled binary trees of t terminal vertices.

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号