首页> 外文会议>International Symposium on Mathematical Foundations of Computer Science >Crochemore Factorization of Sturmian and Other Infinite Words
【24h】

Crochemore Factorization of Sturmian and Other Infinite Words

机译:斯特林和其他无限话语的鳄鱼科学

获取原文

摘要

The Crochemore factorization was introduced by Crochemore for the design of a linear time algorithm to detect squares in a word. We give here the explicit description of the Crochemore factorization for some classes of infinite words, namely characteristic Sturmian words, (generalized) Thue-Morse words, and the period doubling sequence.
机译:CroChemore引入了Crochemore因分解,用于设计线性时间算法以检测单词中的正方形。我们在这里展示了对一些类无限单词的Crochemore因分解的明确描述,即特征的Sturmian词,(广义)Thue-Morse词和时期倍增序列。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号