Papers
Topics
Authors
Recent
Search
2000 character limit reached

Common factors in automatic and Sturmian sequences

Published 1 Feb 2018 in math.CO and cs.FL | (1802.00325v1)

Abstract: In this short note we show that a k-automatic sequence and a Sturmian sequence cannot have arbitrarily large factors in common.

Citations (2)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up