首页 | 官方网站   微博 | 高级检索  
     


Overlap-freeness in infinite partial words
Authors:Vesa Halava  Tero Harju  Tomi Kärki  Patrice Séébold
Affiliation:1. Department of Mathematics and Turku Centre for Computer Science, University of Turku, FIN-20014 Turku, Finland;2. LIRMM, UMR 5506 CNRS, 161 rue Ada 34392 Montpellier, France;3. Département Mathématiques et Informatique Appliquées, Université Paul Valéry, Route de Mende, 34199 Montpellier Cedex 5, France
Abstract:We prove that there exist infinitely many infinite overlap-free binary partial words containing at least one hole. Moreover, we show that these words cannot contain more than one hole and the only hole must occur either in the first or in the second position. We define that a partial word is k-overlap-free if it does not contain a factor of the form xyxyx where the length of x is at least k. We prove that there exist infinitely many 2-overlap-free binary partial words containing an infinite number of holes.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号