A periodicity lemma for partial words
From MaRDI portal
Publication:2113379
DOI10.1016/J.IC.2020.104677OpenAlexW3111848388WikidataQ124883396 ScholiaQ124883396MaRDI QIDQ2113379FDOQ2113379
Tomasz Waleń, Wojciech Rytter, Tomasz Kociumaka, Jakub Radoszewski
Publication date: 14 March 2022
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1801.01096
Recommendations
- On periodicity lemma for partial words
- Periodicity properties on partial words
- Periodicity on partial words
- A periodicity theorem on words and applications
- A periodicity result of partial words with one hole
- Periodicity algorithms for partial words
- An algorithmic toolbox for periodic partial words
- Periodicity algorithms and a conjecture on overlaps in partial words
- Partial words and the interaction property of periods
- An account of speciality of partial words with respect to periodicity
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Uniqueness Theorems for Periodic Functions
- The new periodicity lemma revisited
- A New Periodicity Lemma
- A new approach to the periodicity lemma on strings with holes
- On Fine and Wilf's theorem for bidimensional words.
- Title not available (Why is that?)
- Partial words and a theorem of Fine and Wilf
- Abelian periods, partial words, and an extension of a theorem of Fine and Wilf
- Fine and Wilf's theorem for three periods and a generalization of Sturmian words
- Fine and Wilf words for any periods. II
- FINE AND WILF'S THEOREM FOR PARTIAL WORDS WITH ARBITRARILY MANY WEAK PERIODS
- Partial words and the interaction property of periods
- Partial words and a theorem of Fine and Wilf revisited
- Graph connectivity, partial words, and a theorem of Fine and Wilf
- Periodicity on partial words
- On periodicity lemma for partial words
- FINE AND WILF'S THEOREM FOR k-ABELIAN PERIODS
- On a paper by Castelli, Mignosi, Restivo
- Title not available (Why is that?)
- Continued Fractions without Tears
- Fine and Wilf’s Theorem and Pseudo-repetitions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Periods in partial words: an algorithm
Cited In (12)
- Semiperiodic words and root-conjugacy.
- Partial words and the interaction property of periods
- An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms
- Title not available (Why is that?)
- Periodicity algorithms and a conjecture on overlaps in partial words
- An algorithmic toolbox for periodic partial words
- A generalization of Thue freeness for partial words
- Periodicity on partial words
- Lexicographically least words in the orbit closure of the Rudin-Shapiro word
- Periods in partial words: an algorithm
- Recurrent Partial Words and Representable Sets.
- Special issue: Selected papers of the 12th international conference on language and automata theory and applications, LATA 2018
This page was built for publication: A periodicity lemma for partial words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2113379)
