Fully bordered words
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F17%3A10369425" target="_blank" >RIV/00216208:11320/17:10369425 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.tcs.2016.10.020" target="_blank" >http://dx.doi.org/10.1016/j.tcs.2016.10.020</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.tcs.2016.10.020" target="_blank" >10.1016/j.tcs.2016.10.020</a>
Alternative languages
Result language
angličtina
Original language name
Fully bordered words
Original language description
We characterize binary words that have exactly two unbordered conjugates and show that they can be expressed as a product of two palindromes.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics
Result continuities
Project
<a href="/en/project/GA13-01832S" target="_blank" >GA13-01832S: General algebra and its connections to computer science</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2017
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
Theoretical Computer Science
ISSN
0304-3975
e-ISSN
—
Volume of the periodical
2017
Issue of the periodical within the volume
684
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
6
Pages from-to
53-58
UT code for WoS article
000404698500005
EID of the result in the Scopus database
—