›› 2004, Vol. 30 ›› Issue (24): 26-.
• Papers • Previous Articles Next Articles
GAO Pingan, LUO Zhukai
Published:
高平安,罗铸楷
Abstract: 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. This method is appied widely in many fields.
摘要: 给出了内动机下向树中的每一层节点数的计算公式,定出了自动机的图型是圈-树形的充分必要条件。该方法在很多领域有着广泛的应用。
关键词: 自动机, 下向树, 圈-树形
CLC Number:
TP301.1
GAO Pingan, LUO Zhukai. Automata over Boolean Algebra[J]. , 2004, 30(24): 26-.
高平安,罗铸楷. 布尔代数上的自动机[J]. , 2004, 30(24): 26-.
/ Recommend / Download Citations
URL: https://www.ecice06.com/EN/Y2004/V30/I24/26