String attractors of Rote sequences
In this paper, we describe minimal string attractors (of size two) of pseudopalindromic prefixes of standard complementary-symmetric Rote sequences. Such a class of Rote sequences forms a subclass of binary generalized pseudostandard sequences, i.e., of sequences obtained when iterating palindromic...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2024-11-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Subjects: | |
| Online Access: | http://dmtcs.episciences.org/12385/pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | In this paper, we describe minimal string attractors (of size two) of pseudopalindromic prefixes of standard complementary-symmetric Rote sequences. Such a class of Rote sequences forms a subclass of binary generalized pseudostandard sequences, i.e., of sequences obtained when iterating palindromic and antipalindromic closures. When iterating only palindromic closure, palindromic prefixes of standard Sturmian sequences are obtained and their string attractors are of size two. However, already when iterating only antipalindromic closure, antipalindromic prefixes of binary pseudostandard sequences are obtained and we prove that the minimal string attractors are of size three in this case. We conjecture that the pseudopalindromic prefixes of any binary generalized pseudostandard sequence have a minimal string attractor of size at most four. |
|---|---|
| ISSN: | 1365-8050 |