Author:
Parshina Olga,Zamboni Luca Q.
Funder
Université de Lyon
French National Research Agency
Russian Foundation for Basic Research
Reference19 articles.
1. Palindrome complexity;Allouche;Theoret. Comput. Sci.,2003
2. Représentation géométrique de suites de complexité 2n+1;Arnoux;Bull. Soc. Math. France,1991
3. Sturmian and episturmian words (a survey of some recent results);Berstel,2007
4. Enumeration and structure of trapezoidal words;Bucci;Theoret. Comput. Sci.,2013
5. Periodic-like words, periodicity and boxes;Carpi;Acta Inform.,2001
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Finite and infinite closed-rich words;Theoretical Computer Science;2024-02
2. On Closed-Rich Words;Computer Science – Theory and Applications;2021