Subject
General Computer Science,Theoretical Computer Science
Reference16 articles.
1. Sequences with minimal block growth;Coven;Math. Syst. Theory,1973
2. Abelian complexity in minimal subshifts;Richomme;J. Lond. Math. Soc.,2011
3. Recurrent words with constant Abelian complexity;Currie;Acta Appl. Math.,2011
4. Avoiding Abelian powers in binary words with bounded Abelian complexity;Cassaigne;Int. J. Found. Comput. Sci.,2011
5. Balance and Abelian complexity of the Tribonacci word;Richomme;Acta Appl. Math.,2010
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Minimal Complexities for Infinite Words Written with d Letters;Lecture Notes in Computer Science;2023
2. Relations on words;Indagationes Mathematicae;2017-02
3. Abelian Complexity of Thue-Morse Word over a Ternary Alphabet;Lecture Notes in Computer Science;2017
4. Abelian properties of Parry words;Theoretical Computer Science;2015-02
5. Bibliography;Formal Languages, Automata and Numeration Systems 2;2014-09-12