Common factors in automatic and Sturmian sequences
Combinatorics
2018-02-02 v1 Formal Languages and Automata Theory
Abstract
In this short note we show that a k-automatic sequence and a Sturmian sequence cannot have arbitrarily large factors in common.
Cite
@article{arxiv.1802.00325,
title = {Common factors in automatic and Sturmian sequences},
author = {Narad Rampersad and Jeffrey Shallit},
journal= {arXiv preprint arXiv:1802.00325},
year = {2018}
}