Author:
Badkobeh Golnaz,Fici Gabriele,Lipták Zsuzsanna
Publisher
Springer International Publishing
Reference13 articles.
1. Badkobeh, G., Bannai, H., Goto, K., I, T., Iliopoulos, C.S., Inenaga, S., Puglisi, S.J., Sugimoto, S.: Closed factorization. In: Proceedings of the Prague Stringology Conference 2014, pp. 162–168 (2014)
2. Brlek, S., Hamel, S., Nivat, M., Reutenauer, C.: On the palindromic complexity of infinite words. Internat. J. Found. Comput. Sci. 15, 293–306 (2004)
3. Bucci, M., De Luca, A., Fici, G.: Enumeration and Structure of Trapezoidal Words. Theoret. Comput. Sci. 468, 12–22 (2013)
4. Bucci, M., De Luca, A., Glen, A., Zamboni, L.: A new characteristic property of rich words. Theoretical Computer Science 410(30), 2860–2863 (2009)
5. Lecture Notes in Computer Science;M Bucci,2009
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Asymptotic Bounds for the Number of Closed and Privileged Words;The Electronic Journal of Combinatorics;2024-06-14
2. Closed Ziv–Lempel factorization of the m-bonacci words;Theoretical Computer Science;2022-05
3. Maximal Closed Substrings;String Processing and Information Retrieval;2022
4. On Closed-Rich Words;Computer Science – Theory and Applications;2021
5. Efficient Identification of k-Closed Strings;International Journal of Foundations of Computer Science;2020-08