2013年1月
Abelian complexity and abelian co-decomposition
THEORETICAL COMPUTER SCIENCE
- 巻
- 469
- 号
- 開始ページ
- 77
- 終了ページ
- 91
- 記述言語
- 英語
- 掲載種別
- 研究論文(学術雑誌)
- DOI
- 10.1016/j.tcs.2012.10.034
- 出版者・発行元
- ELSEVIER SCIENCE BV
We propose a technique for exploring the abelian complexity of recurrent infinite words, focusing particularly on infinite words associated with Parry numbers. Using that technique, we give an affirmative answer to the open question posed by Richomme, Saari and Zamboni, whether the abelian complexity of the Tribonacci word attains each value in {4, 5, 6} infinitely many times. (c) 2012 Elsevier B.V. All rights reserved.
- リンク情報
- ID情報
-
- DOI : 10.1016/j.tcs.2012.10.034
- ISSN : 0304-3975
- Web of Science ID : WOS:000314137900006