Complexity of infinite words associated with non-simple Parry numbers

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21340%2F08%3A04150934" target="_blank" >RIV/68407700:21340/08:04150934 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Complexity of infinite words associated with non-simple Parry numbers
Original language description
The aim of our work is to compute the (factor) complexityfunction $C(n)$ of the infinite word $u_beta$ associated with $beta$-expansions, where $beta$ is a non-simple Parry number. In general it is hard to find an explicit formula for the complexity function of an infinite word $u$ and it seems it holds also for the case of $u_beta$. However, we are able to find all left special factors that, in a certain sense, completely determine the complexity.
Czech name
Komplexita nekonečných slov přidružených nejednoduchým Parry číslům
Czech description
The aim of our work is to compute the (factor) complexityfunction $C(n)$ of the infinite word $u_beta$ associated with $beta$-expansions, where $beta$ is a non-simple Parry number. In general it is hard to find an explicit formula for the complexity function of an infinite word $u$ and it seems it holds also for the case of $u_beta$. However, we are able to find all left special factors that, in a certain sense, completely determine the complexity.

Project
<a href="/en/project/LC06002" target="_blank" >LC06002: Doppler Institute for Mathematical Physics and Applied Mathematics</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year
2008
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)