All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Palindromic complexity of infinite words associated with non-simple Parry numbers

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21340%2F09%3A04139761" target="_blank" >RIV/68407700:21340/09:04139761 - isvavai.cz</a>

  • Result on the web

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    Palindromic complexity of infinite words associated with non-simple Parry numbers

  • Original language description

    We study the palindromic complexity of infinite words $u_beta$, the fixed points of the substitution over a binary alphabet, $varphi(0)=0^a1$, $varphi(1)=0^b1$, with $a-1geq bgeq 1$, which are canonically associated with quadratic non-simple Parry numbers $beta$.

  • Czech name

    Palindromická složitost nekonečných slov přidružených nejednoduchým Parryho číslům

  • Czech description

    We study the palindromic complexity of infinite words $u_beta$, the fixed points of the substitution over a binary alphabet, $varphi(0)=0^a1$, $varphi(1)=0^b1$, with $a-1geq bgeq 1$, which are canonically associated with quadratic non-simple Parry numbers $beta$.

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    BA - General mathematics

  • OECD FORD branch

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

    Z - Vyzkumny zamer (s odkazem do CEZ)

Others

  • Publication year

    2009

  • 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

    RAIRO - Theoretical Informatics and Applications

  • ISSN

    0988-3754

  • e-ISSN

  • Volume of the periodical

    43

  • Issue of the periodical within the volume

    1

  • Country of publishing house

    FR - FRANCE

  • Number of pages

    19

  • Pages from-to

  • UT code for WoS article

    000261431800007

  • EID of the result in the Scopus database