Publisher
Springer Berlin Heidelberg
Reference8 articles.
1. de Bruijn, N.G.: A combinatorial problem. Nederl. Akad. Wetensch., Proc. 49, 758–764 (1946); Indagationes Math. 8, 461–467 (1946)
2. Carpi, A., de Luca, A.: Semiperiodic words and root-conjugacy. Theoret. Comput. Sci. 292, 111–130 (2003)
3. Fine, N.J., Wilf, H.S.: Uniqueness theorems for periodic functions. Proc. Amer. Math. Soc. 16, 109–114 (1965)
4. Gallant, J., Maier, D., Storer, J.A.: On finding minimal length superstrings. J. Comput. System Sci. 20, 50–58 (1980)
5. Blanchet-Sadri, F., Simmons, S.: Deciding representability of sets of words of equal length. Theoret. Comput. Sci. 475, 34–46 (2013)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献