String attractors of Rote sequences
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21340%2F24%3A00373170" target="_blank" >RIV/68407700:21340/24:00373170 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.46298/dmtcs.12385" target="_blank" >https://doi.org/10.46298/dmtcs.12385</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.46298/dmtcs.12385" target="_blank" >10.46298/dmtcs.12385</a>
Alternative languages
Result language
angličtina
Original language name
String attractors of Rote sequences
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics
Result continuities
Project
<a href="/en/project/EF16_019%2F0000778" target="_blank" >EF16_019/0000778: Center for advanced applied science</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach
Others
Publication year
2024
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Discrete Mathematics and Theoretical Computer Science
ISSN
1462-7264
e-ISSN
1365-8050
Volume of the periodical
26
Issue of the periodical within the volume
3
Country of publishing house
FR - FRANCE
Number of pages
16
Pages from-to
—
UT code for WoS article
001355364700003
EID of the result in the Scopus database
2-s2.0-85211008627