首页    期刊浏览 2024年12月06日 星期五
登录注册

文章基本信息

  • 标题:Constructing Premaximal Binary Cube-free Words of Any Level
  • 本地全文:下载
  • 作者:Elena A. Petrova ; Arseny M. Shur
  • 期刊名称:Electronic Proceedings in Theoretical Computer Science
  • 电子版ISSN:2075-2180
  • 出版年度:2011
  • 卷号:63
  • 页码:168-178
  • DOI:10.4204/EPTCS.63.23
  • 出版社:Open Publishing Association
  • 摘要:We study the structure of the language of binary cube-free words. Namely, we are interested in the cube-free words that cannot be infinitely extended preserving cube-freeness. We show the existence of such words with arbitrarily long finite extensions, both to one side and to both sides.
国家哲学社会科学文献中心版权所有