1. Lecture Notes in Computer Science;S. Alstrup,2000
2. Apostolico, A., Farach, M., Iliopoulos, C.S.: Optimal Superprimitivity Testing for Strings. Inform. Processing Letter 39, 17–20 (1991)
3. Badkobeh, G., Bannai, H., Goto, K.: I, Tomohiro, Iliopoulos, C. S., Inenaga, S., Puglisi, S.J., Sugimoto, S.: Closed Factorization (to appear)
4. Badkobeh, G., Fici, G., Lipták, Z.: A Note on Words With the Smallest Number of Closed Factors. CoRR abs/1305.6395 (2013)
5. Breslauer, D.: An On-Line String Superprimitivity Test. Information Processing Letters 44, 345–347 (1992)