Author:
Loptev Alexander,Kucherov Gregory,Starikovskaya Tatiana
Publisher
Springer International Publishing
Reference16 articles.
1. Assous, R., Pouzet, M.: Une caractérisation des mots périodiques. Discrete Math. 25(1), 1–5 (1979)
2. Clément, J., Giambruno, L.: On the number of prefix and border tables. In: Pardo, A., Viola, A. (eds.) LATIN 2014. LNCS, vol. 8392, pp. 442–453. Springer, Heidelberg (2014)
3. Duval, J.-P.: Relationship between the period of a finite word and the length of its unbordered segments. Discrete Math. 40(1), 31–44 (1982)
4. Duval, J.-P., Lecroq, T., Lefebvre, A.: Border array on bounded alphabet. J. Autom. Lang. Comb. 10(1), 51–60 (2005)
5. Duval, J.-P., Lecroq, T., Lefebvre, A.: Efficient validation and construction of Knuth-Morris-Pratt arrays. In: Proceedings of Conference in Honor of Donald E. Knuth (2007)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Maximal unbordered factors of random strings;Theoretical Computer Science;2021-01
2. Periods and Borders of Random Words;LEIBNIZ INT PR INFOR;2016
3. Maximal Unbordered Factors of Random Strings;String Processing and Information Retrieval;2016
4. Computing the Longest Unbordered Substring;String Processing and Information Retrieval;2015