Constructions of words rich in palindromes and pseudopalindromes
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21340%2F16%3A00306339" target="_blank" >RIV/68407700:21340/16:00306339 - isvavai.cz</a>
Alternative codes found
RIV/68407700:21240/16:00306339
Result on the web
<a href="https://dmtcs.episciences.org/2202" target="_blank" >https://dmtcs.episciences.org/2202</a>
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Constructions of words rich in palindromes and pseudopalindromes
Original language description
A narrow connection between infinite binary words rich in classical palindromes and infinite binary words rich simultaneously in palindromes and pseudopalindromes (the so-called H-rich words) is demonstrated. The correspondence between rich and H-rich words is based on the operation S acting over words over the alphabet {0,1} and defined by S(u0u1u2...)=v1v2v3..., where vi=ui-1+uimod2. The operation S enables us to construct a new class of rich words and a new class of H-rich words. Finally, the operation S is considered on the multiliteral alphabet Zm as well and applied to the generalized Thue--Morse words. As a byproduct, new binary rich and H-rich words are obtained by application of S on the generalized Thue--Morse words over the alphabet Z4.
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
Result was created during the realization of more than one project. More information in the Projects tab.
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
Discrete Mathematics and Theoretical Computer Science
ISSN
1462-7264
e-ISSN
—
Volume of the periodical
18
Issue of the periodical within the volume
3
Country of publishing house
FR - FRANCE
Number of pages
26
Pages from-to
1-26
UT code for WoS article
—
EID of the result in the Scopus database
—