Author:
Avgustinovich Sergey,Karhumäki Juhani,Puzynina Svetlana
Subject
Computer Science Applications,General Mathematics,Software
Reference12 articles.
1. Avgustinovich S.V. and Frid A.E., Words avoiding abelian inclusions.J. Autom. Lang. Comb.7(2002) 3–9.
2. Césari Y. and Vincent M., Une caractérisation des mots périodiques.C.R. Acad. Sci. Paris, Ser. A286(1978) 1175–1177.
3. Cassaigne J. and Karhumäki J., Toeplitz words, generalized periodicity and periodically iterated morphisms.Eur. J. Comb.18(1997) 497–510.
4. Cassaigne J., Richomme G., Saari K. and Zamboni L.Q., Avoiding Abelian powers in binary words with bounded Abelian complexity.Int. J. Found. Comput. Sci.22(2011) 905–920.
5. Duval J.-P., Périodes et répetitions des mots du monoide libre.Theoret. Comput. Sci.9(1979) 17–26.
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Abelian combinatorics on words: A survey;Computer Science Review;2023-02
2. Dyck Words, Lattice Paths, and Abelian Borders;International Journal of Foundations of Computer Science;2022-04
3. Abelian Properties of Words;Lecture Notes in Computer Science;2019
4. On k -abelian palindromes;Information and Computation;2018-06
5. Dyck Words, Lattice Paths, and Abelian Borders;Electronic Proceedings in Theoretical Computer Science;2017-08-21