On an algorithm for multiperiodic words
\v{S}t\v{e}p\'an Holub
TL;DR
This paper analyzes an algorithm for constructing words with specified periods and alphabet richness, providing a clear statement and proof of correctness using class equivalence.
Contribution
It simplifies the description and correctness proof of Tijdeman and Zamboni's algorithm for multiperiodic words using class equivalence.
Findings
Algorithm can be easily stated and understood.
Correctness of the algorithm is briefly proved.
Applicable to words with given periods and rich alphabets.
Abstract
We consider an algorithm by Tijdeman and Zamboni constructing a word of a given length that has a given set of periods, and the richest possible alphabet. We show that this algorithm can be easily stated and its correctness briefly proved using the class equivalence approach.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.