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”

Morphic images of episturmian words having finite palindromic defect

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F16%3A00230715" target="_blank" >RIV/68407700:21240/16:00230715 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1016/j.ejc.2015.07.001" target="_blank" >http://dx.doi.org/10.1016/j.ejc.2015.07.001</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1016/j.ejc.2015.07.001" target="_blank" >10.1016/j.ejc.2015.07.001</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Morphic images of episturmian words having finite palindromic defect

  • Original language description

    We study morphisms from certain classes and their action on episturmian words.The first class is $P_{ret}$. In general, a morphism of class $P_{ret}$ can map an infinite word having zero palindromic defect to a word having infinite palindromic defect. We show that the image of an episturmian word, which has zero palindromic defect, under a morphism of class $P_{ret}$ has always its palindromic defect finite. We also focus on letter-to-letter morphisms to binary alphabet: we show that images of ternary episturmian words under such morphisms have zero palindromic defect. These results contribute to the study of an unsolved question of characterization of morphisms that preserve finite, or even zero, palindromic defect. They also enable us to construct new examples of binary words having zero or finite $H$-palindromic defect, where $H = {{rm Id}, R, E, RE }$ is the group generated by both involutory antimorphisms on a binary alphabet.

  • Czech name

  • Czech description

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

    <a href="/en/project/GP13-35273P" target="_blank" >GP13-35273P: Algorithms for circular morphisms and their fixed points</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2016

  • 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

    European Journal of Combinatorics

  • ISSN

    0195-6698

  • e-ISSN

  • Volume of the periodical

    51

  • Issue of the periodical within the volume

    January

  • Country of publishing house

    NL - THE KINGDOM OF THE NETHERLANDS

  • Number of pages

    13

  • Pages from-to

    359-371

  • UT code for WoS article

    000362144400028

  • EID of the result in the Scopus database

    2-s2.0-84937231453