Funder
Japan Society for the Promotion of Science
Precursory Research for Embryonic Science and Technology
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference28 articles.
1. Badkobeh, G., Bannai, H., Goto, K., I, T., Iliopoulos, C.S., Inenaga, S., Puglisi, S.J., Sugimoto, S.: Closed factorization. Discret. Appl. Math. 212, 23–29 (2016)
2. Bannai, H., I, T., Inenaga, S., Nakashima, Y., Takeda, M., Tsuruta, K.: The “runs” theorem. SIAM J. Comput. 46(5), 1501–1514 (2017)
3. Bannai, H., Gagie, T., Inenaga, S., Kärkkäinen, J., Kempa, D., Piatkowski, M., Sugimoto, S.: Diverse palindromic factorization is NP-complete. Int. J. Found. Comput. Sci. 29(2), 143–164 (2018)
4. Borozdin, K., Kosolobov, D., Rubinchik, M., Shur, A.M.: Palindromic Length in Linear Time. In: CPM 2017, pp. 23:1–23:12 (2017)
5. Chen, K.T., Fox, R.H., Lyndon, R.C.: Free differential calculus. iv. The quotient groups of the lower central series. Ann. Math. 68(1), 81–95 (1958)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Repetition Factorization of Automatic Sequences;International Journal of Foundations of Computer Science;2024-07-30
2. Largest Repetition Factorization of Fibonacci Words;String Processing and Information Retrieval;2023