Funder
Ministarstvo Prosvete, Nauke i Tehnološkog Razvoja
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference26 articles.
1. On highly palindromic words: The ternary case;Ago;Discrete Appl. Math.,2020
2. Algorithms for jumbled indexing, jumbled border and jumbled square on run-length encoded strings;Amir;Theoret. Comput. Sci.,2016
3. Counter-intuitive answers to some questions concerning minimal-palindromic extensions of binary words;Bašić;Discrete Appl. Math.,2012
4. F. Blanchet-Sadri, K. Chen, K. Hawes, Dyck words, lattice paths, and abelian borders, in: Proceedings 15th International Conference on Automata and Formal Languages, AFL 2017, Debrecen, Hungary, 2017, pp. 56–70.
5. F. Blanchet-Sadri, A. Tebbe, A. Veprauskas, Fine and Wilf’s theorem for abelian periods in partial words, in: Proceedings of the 13th Mons Theoretical Computer Science Days, Amiens, France, 2010.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献