Pseudoperiodic Words and a Question of Shevelev - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Mathematics and Theoretical Computer Science Année : 2023

Pseudoperiodic Words and a Question of Shevelev

Résumé

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.
Fichier principal
Vignette du fichier
2207.10171.pdf (618.46 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04244909 , version 1 (17-10-2023)

Identifiants

Citer

Joseph Meleshko, Pascal Ochem, Jeffrey Shallit, Sonja Linghui Shan. Pseudoperiodic Words and a Question of Shevelev. Discrete Mathematics and Theoretical Computer Science, 2023, 25:2 (Automata, Logic and Semantics), ⟨10.46298/dmtcs.9919⟩. ⟨hal-04244909⟩
19 Consultations
3 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More