Pseudoperiodic Words and a Question of Shevelev
Combinatorics
2024-02-14 v3 Discrete Mathematics
Formal Languages and Automata Theory
Abstract
We generalize the familiar notion of periodicity in sequences to a new kind of pseudoperiodicity, and we prove some basic results about it. We revisit the results of a 2012 paper of Shevelev and reprove his results in a simpler and more unified manner, and provide a complete answer to one of his previously unresolved questions. We consider finding words with specific pseudoperiod and having the smallest possible critical exponent. Finally, we consider the problem of determining whether a finite word is pseudoperiodic of a given size, and show that it is NP-complete.
Cite
@article{arxiv.2207.10171,
title = {Pseudoperiodic Words and a Question of Shevelev},
author = {Joseph Meleshko and Pascal Ochem and Jeffrey Shallit and Sonja Linghui Shan},
journal= {arXiv preprint arXiv:2207.10171},
year = {2024}
}