Author:
de Luca Aldo,Glen Amy,Zamboni Luca Q.
Subject
General Computer Science,Theoretical Computer Science
Reference14 articles.
1. Palindromic complexity of infinite words associated with simple Parry numbers;Ambrož;Ann. Inst. Fourier (Grenoble),2006
2. Palindromes and pseudo-palindromes in episturmian and pseudo-palindromic infinite words;Anne,2005
3. Sturmian Words;Berstel,2002
4. M. Bucci, A. De Luca, A. Glen, L.Q. Zamboni, A connection between palindromic and factor complexity using return words, Adv. Appl. Math. (2008), to appear
5. A combinatorial problem on trapezoidal words;D’Alessandro;Theoret. Comput. Sci.,2002
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献