Publisher
Springer Nature Switzerland
Reference7 articles.
1. Petrova, E.A., Shur, A.M.: Transition property for cube-free words. Theory of Computing Systems 65(3), 479–496 (2020). https://doi.org/10.1007/s00224-020-09979-4
2. Rampersad, N.: Overlap-free words and generalizations. A thesis, University of Waterloo (2007). http://hdl.handle.net/10012/3421
3. Restivo, A., Salemi, S.: Some decision results on nonrepetitive words. In: Apostolico, A., Galil, Z. (eds.) Combinatorial Algorithms on Words, pp. 289–295. Springer, Berlin Heidelberg, Berlin, Heidelberg (1985). https://doi.org/10.1007/978-3-642-82456-2_20
4. Lecture Notes in Computer Science;J Rukavicka,2020
5. Shallit, J., Shur, A.: Subword complexity and power avoidance. Theor. Comput. Sci. 792, 96–116 (2019)