Common factors in automatic and Sturmian sequences
classification
🧮 math.CO
cs.FL
keywords
commonfactorssequencesturmianarbitrarilyautomaticcannotk-automatic
read the original abstract
In this short note we show that a k-automatic sequence and a Sturmian sequence cannot have arbitrarily large factors in common.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.