搜索结果: 1-2 共查到“组合数学 Complexity”相关记录2条 . 查询时间(0.098 秒)
Absolutely symmetric trees and complexity of natural number
Absolutely symmetric trees complexity of natural number Combinatorics
2012/5/24
We consider the rooted trees which not have isomorphic representation and introduce a conception of complexity a natural number also. The connection between quantity such trees with $n$ edges and a co...
On abelian and additive complexity in infinite words
additive complexity infinite words Combinatorics
2011/9/19
Abstract: The study of the structure of infinite words having bounded abelian complexity was initiated by G. Richomme, K. Saari, and L. Q. Zamboni. In this note we define bounded additive complexity f...