Author:
Balková Lʼubomíra,Pelantová Edita,Starosta Štěpán
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. Lʼ. Balková, E. Pelantová, Š. Starosta, Sturmian jungle (or garden?) on multiliteral alphabets, RAIRO – Theor. Inform. Appl. (2010), in press, arXiv:1003.1224, the original publication is available at www.edpsciences.org/ita.
4. Combinatorial properties of f-palindromes in the Thue–Morse sequences;Blondin-Massé;PUMA,2008
5. On the palindromic complexity of infinite words;Brlek;Internat. J. Found. Comput. Sci.,2004
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献