Author:
Balková L’ubomíra,Pelantová Edita
Subject
General Computer Science,Theoretical Computer Science
Reference13 articles.
1. Palindrome complexity;Allouche;Theoret. Comput. Sci.,2003
2. Factor versus palindromic complexity of uniformly recurrent infinite words;Baláži;Theoret. Comput. Sci.,2007
3. Fréquences des facteurs des suites sturmiennes;Berthé;Theoret. Comput. Sci.,1996
4. J. Berstel, L. Boasson, O. Carton, I. Fagnot, Infinite words without palindromes, preprint, 2006
5. A condition for unique ergodicity of minimal symbolic flows;Boshernitzan;Ergodic Theory Dynam. Systems,1992
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献