Number of restrictions required for periodic word in the finite alphabet

Abstract

This work describes the number of restricted finite words in the alphabet A=a,b required to identify an infinite word with some period n in the set of all infinite words in this alphabet given up to a shift. Also reviewed the case of multiletter alphabet.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…