LARGE SIMPLE BINARY EQUALITY WORDS

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F12%3A10127465" target="_blank" >RIV/00216208:11320/12:10127465 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1142/S0129054112500207" target="_blank" >http://dx.doi.org/10.1142/S0129054112500207</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1142/S0129054112500207" target="_blank" >10.1142/S0129054112500207</a>

Result language
angličtina
Original language name
LARGE SIMPLE BINARY EQUALITY WORDS
Original language description
Let two nonperiodic binary morphisms g, h : {a,b}* -> Delta* be given. A word w is called a solution of q and h if g(w)= h(w). We say that a solution w is simple if whenever w_1, w_1u, w_2 and w_2u' are prefixes of w^omega such that g(w_1)z = h(w_2), andg(w_1u)z = h(w_2u') for some word z, then |u| = |u'| = k |w|, for some k is an element of N. In this paper we will study simple solutions and show that if a word w is a simple solution containing at least nine occurrences of the letter a and at least nine occurrences of the letter b, then either w = (ab)^ia, or w = a^jb^k with gcd(j, k) = 1, up to the exchange of letters a and b.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—

Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)