Binary equality words with two b's
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F18%3A10383314" target="_blank" >RIV/00216208:11320/18:10383314 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.14712/1213-7243.2015.247" target="_blank" >https://doi.org/10.14712/1213-7243.2015.247</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.14712/1213-7243.2015.247" target="_blank" >10.14712/1213-7243.2015.247</a>
Alternative languages
Result language
angličtina
Original language name
Binary equality words with two b's
Original language description
Deciding whether a given word is an equality word of two nonperiodic morphisms is also known as the dual Post correspondence problem. Although the problem is decidable, there is no practical decision algorithm. Already in the binary case, the classification is a large project dating back to 1980s. In this paper we give a full classification of binary equality words in which one of the letters has two occurrences.
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
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2018
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
Commentationes Mathematicae Universitatis Carolinae
ISSN
0010-2628
e-ISSN
—
Volume of the periodical
59
Issue of the periodical within the volume
2
Country of publishing house
CZ - CZECH REPUBLIC
Number of pages
20
Pages from-to
153-172
UT code for WoS article
000446183900002
EID of the result in the Scopus database
2-s2.0-85035759181