搜索结果: 1-1 共查到“组合数学 additive complexity”相关记录1条 . 查询时间(0.078 秒)
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...