Automatic Sequences of Rank Two

08/11/2021

∙

by   Jason Bell, et al.

∙

0

∙

share

Given a right-infinite word x over a finite alphabet A, the rank of x is the size of the smallest set S of words over A such that x can be realized as an infinite concatenation of words in S. We show that the property of having rank two is decidable for the class of k-automatic words for each integer k≥ 2.