A length bound for binary equality words

被引：0
|
作者：
Hadravova, Jana [1 ]
机构：
[1] Charles Univ Prague, Fac Math & Phys, Dept Algebra, Sokolovska 83, Prague 18675 8, Czech Republic
来源：
COMMENTATIONES MATHEMATICAE UNIVERSITATIS CAROLINAE | 2011年 / 52卷 / 01期
关键词：
combinatorics on words; binary equality languages;
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Let w be an equality word of two binary non-periodic morphisms g,h : {a, b}* -> Delta* with unique overflows. It is known that if w contains at least 25 occurrences of each of the letters a and b, then it has to have one of the following special forms: up to the exchange of the letters a and b either w = (ab)(i)a, or w = a(i) b(j) with gcd(j,j) = 1. We will generalize the result, justify this bound and prove that it can be lowered to nine occurrences of each of the letters a and b.
引用
收藏
页码：1 / 20
页数：20
相关论文
共 50 条
12345