Binary patterns in the Prouhet-Thue-Morse sequence

Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14310%2F21%3A00119378" target="_blank" >RIV/00216224:14310/21:00119378 - isvavai.cz</a>
Výsledek na webu
<a href="https://dmtcs.episciences.org/8398" target="_blank" >https://dmtcs.episciences.org/8398</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.46298/dmtcs.5460" target="_blank" >10.46298/dmtcs.5460</a>

Jazyk výsledku
angličtina
Název v původním jazyce
Binary patterns in the Prouhet-Thue-Morse sequence
Popis výsledku v původním jazyce
We show that, with the exception of the words a(2)ba(2) and b(2)ab(2), all (finite or infinite) binary patterns in the Prouhet-Thue-Morse sequence can actually be found in that sequence as segments (up to exchange of letters in the infinite case). This result was previously attributed to unpublished work by D. Guaiana and may also be derived from publications of A. Shur only available in Russian. We also identify the (finitely many) finite binary patterns that appear non trivially, in the sense that they are obtained by applying an endomorphism that does not map the set of all segments of the sequence into itself.
Název v anglickém jazyce
Binary patterns in the Prouhet-Thue-Morse sequence
Popis výsledku anglicky
We show that, with the exception of the words a(2)ba(2) and b(2)ab(2), all (finite or infinite) binary patterns in the Prouhet-Thue-Morse sequence can actually be found in that sequence as segments (up to exchange of letters in the infinite case). This result was previously attributed to unpublished work by D. Guaiana and may also be derived from publications of A. Shur only available in Russian. We also identify the (finitely many) finite binary patterns that appear non trivially, in the sense that they are obtained by applying an endomorphism that does not map the set of all segments of the sequence into itself.

Druh
J<sub>imp</sub> - Článek v periodiku v databázi Web of Science
CEP obor
—
OECD FORD obor
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt
<a href="/cs/project/GA19-12790S" target="_blank" >GA19-12790S: Efektivní charakterizace tříd konečných pologrup a formálních jazyků</a><br>
Návaznosti
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění
2021
Kód důvěrnosti údajů
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Podobné výsledky(10)