Hide and seek with repetitions

Abstract Pseudo-repetitions are a natural generalization of the classical notion of repetitions in sequences: they are the repeated concatenation of a word and its encoding under a certain morphism or antimorphism. Thus, such occurrences can be regarded as hidden repetitive structures of, or within, a word. We solve fundamental algorithmic questions on pseudo-repetitions by application of insightful combinatorial results on words. More precisely, we efficiently decide whether a word is a pseudo-repetition and find all the pseudo-repetitive factors of a word. We also approach the problem of deciding whether there exists an anti-/morphism for which a word is a pseudo-repetition. We show that some variants of this latter problem are efficiently solvable, while some others are NP-complete.

[1]  T. Apostol.  Introduction to analytic number theory , 1976 .

[2]  Andrzej Ehrenfeucht,et al.  Finding a Homomorphism Between Two Words is NP-Complete , 1979, Inf. Process. Lett..

[3]  Maxime Crochemore,et al.  Algorithms on strings , 2007 .

[4]  Lila Kari,et al.  An extension of the Lyndon-Schützenberger result to pseudoperiodic words , 2011, Inf. Comput..

[5]  Florin Manea,et al.  Testing Generalised Freeness of Words , 2014, STACS.

[6]  Florin Manea,et al.  The Avoidability of Cubes under Permutations , 2012, Developments in Language Theory.

[7]  Florin Manea,et al.  Cubic patterns with permutations , 2015, J. Comput. Syst. Sci..

[8]  Lila Kari,et al.  Properties of Pseudo-Primitive Words and their Applications , 2010, Int. J. Found. Comput. Sci..

[9]  James D. Currie,et al.  Unary Patterns with Permutations , 2015, DLT.

[10]  M. Lothaire.  Combinatorics on words: Bibliography , 1997 .

[11]  Florin Manea,et al.  Fine and Wilf's Theorem and Pseudo-repetitions , 2012, MFCS.

[12]  Zhi Xu,et al.  Pseudopower Avoidance , 2012, Fundam. Informaticae.

[13]  Shinnosuke Seki,et al.  The extended equation of Lyndon and Schützenberger , 2017, J. Comput. Syst. Sci..

[14]  Peter Sanders,et al.  Linear work suffix array construction , 2006, JACM.

[15]  Zhi Xu.  A Minimal Periods Algorithm with Applications , 2010, CPM.

[16]  Dan Gusfield,et al.  Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology , 1997 .

[17]  Florin Manea,et al.  Discovering Hidden Repetitions in Words , 2013, CiE.

[18]  Shinnosuke Seki,et al.  Generalised Lyndon-Schützenberger Equations , 2014, MFCS.

[19]  Florin Manea,et al.  Finding Pseudo-repetitions , 2013, STACS.

[20]  Lila Kari,et al.  On a special class of primitive words , 2010, Theor. Comput. Sci..