scientific article; zbMATH DE number 1052825
From MaRDI portal
zbMATH Open0882.68111MaRDI QIDQ4351065FDOQ4351065
Authors: W. F. Smyth, Larry Cummings
Publication date: 4 February 1998
Title of this publication is not available (Why is that?)
Recommendations
Cited In (15)
- Disjunctivity and other properties of sets of pseudo-bordered words
- Weak repetitions in Sturmian strings.
- An extension of the Lyndon-Schützenberger result to pseudoperiodic words
- Abelian powers and repetitions in Sturmian words
- Abelian Repetitions in Sturmian Words
- Computing regularities in strings: a survey
- A characterization of the squares in a Fibonacci string
- Repetitive perhaps, but certainly not boring
- 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
- Fast computation of abelian runs
- An Extension of the Lyndon Schützenberger Result to Pseudoperiodic Words
- Repetition Detection in a Dynamic String
- Algorithms for jumbled indexing, jumbled border and jumbled square on run-length encoded strings
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4351065)