scientific article; zbMATH DE number 5605094
From MaRDI portal
Publication:3396591
Cited in
(26)- Abelian periods of factors of Sturmian words
- Algorithms for computing abelian periods of words
- On highly palindromic words: the \(n\)-ary case
- Dyck Words, Lattice Paths, and Abelian Borders
- Abelian closures of infinite binary words
- An abelian periodicity lemma
- Fast computation of abelian runs
- Abelian powers and repetitions in Sturmian words
- Periodicity properties on partial words
- An Extension of the Lyndon Schützenberger Result to Pseudoperiodic Words
- On a special class of primitive words
- On a Special Class of Primitive Words
- Abelian repetitions in Sturmian words
- String Periods in the Order-Preserving Model
- Abelian-primitive partial words
- Abelian borders in binary words
- A note on easy and efficient computation of full abelian periods of a word
- Abelian combinatorics on words: a survey
- An extension of the Lyndon-Schützenberger result to pseudoperiodic words
- A periodicity lemma for partial words
- Relations on words
- Algorithms for jumbled indexing, jumbled border and jumbled square on run-length encoded strings
- Disjunctivity and other properties of sets of pseudo-bordered words
- Fast algorithms for abelian periods in words and greatest common divisor queries
- Dyck words, lattice paths, and abelian borders
- String periods in the order-preserving model
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 Q3396591)
