A Class of Automatic Sequences
Abstract
Let k 2. We prove that the characteristic sequence of a regular language over a k-letter alphabet is k-automatic. More generally, if t 2 and t,k are multiplicatively dependent, we show that the characteristic sequence of a regular language over a t-letter alphabet is k-automatic.
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.