Publication:4351065
From MaRDI portal
zbMath0882.68111MaRDI QIDQ4351065
W. F. Smyth, Larry J. Cummings
Publication date: 4 February 1998
68R15: Combinatorics on words
Related Items
Abelian Repetitions in Sturmian Words, Abelian powers and repetitions in Sturmian words, A note on easy and efficient computation of full abelian periods of a word, \(k\)-abelian pattern matching, Algorithms for computing abelian periods of words, Algorithms for jumbled indexing, jumbled border and jumbled square on run-length encoded strings, Fast computation of abelian runs, Disjunctivity and other properties of sets of pseudo-bordered words, An extension of the Lyndon-Schützenberger result to pseudoperiodic words, A characterization of the squares in a Fibonacci string, Weak repetitions in Sturmian strings., Repetitive perhaps, but certainly not boring, Computing regularities in strings: a survey, An Extension of the Lyndon Schützenberger Result to Pseudoperiodic Words