Periods in partial words: an algorithm
From MaRDI portal
Recommendations
- Periods in partial words: an algorithm
- Periodicity algorithms for partial words
- scientific article; zbMATH DE number 1834684
- An algorithmic toolbox for periodic partial words
- Local periods and binary partial words: an algorithm
- Periodicity on partial words
- scientific article; zbMATH DE number 4197990
- Periods and binary words
- A periodicity lemma for partial words
- Periodicity algorithms and a conjecture on overlaps in partial words
Cites work
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 1834684 (Why is no real title available?)
- A new approach to the periodicity lemma on strings with holes
- Algorithmic Combinatorics on Partial Words
- Generalised fine and Wilf's theorem for arbitrary number of periods
- Graph connectivity, partial words, and a theorem of Fine and Wilf
- Handbook of Graph Theory
- Interaction properties of relational periods
- On the combinatorics of finite words
- Partial words and a theorem of Fine and Wilf
- Partial words and the interaction property of periods
- Periods in partial words: an algorithm
- Uniqueness Theorems for Periodic Functions
Cited in
(8)- Combinatorics on partial word borders
- Graph connectivity, partial words, and a theorem of Fine and Wilf
- Periods in partial words: an algorithm
- Periodic partial words and random bipartite graphs
- scientific article; zbMATH DE number 4197990 (Why is no real title available?)
- On periodicity lemma for partial words
- Border correlations, lattices, and the subgraph component polynomial
- A periodicity lemma for partial words
This page was built for publication: Periods in partial words: an algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1932359)