关注我们：

solidot新版网站常见问题，请点击这里查看。

Common factors in automatic and Sturmian sequences. (arXiv:1802.00325v1 [math.CO])

来源于:arXiv
In this short note we show that a k-automatic sequence and a Sturmian sequence cannot have arbitrarily large factors in common. 查看全文>>