A general formula is presented to count the number of nodes in a down-oriented tree. Some necessary and sufficient conditions are presented as well for an autonomous automaton to be a circle tree.
给出了内动机下向树中的每一层节点数的计算公式,定出了自动机的图型是圈-树形的充分必要条件。
参考来源 - 布尔代数上的自动机 in C·2,447,543篇论文数据,部分数据来源于NoteExpress
应用推荐