Equality sets of binary D0L sequences

摘要

We study D0L sequences over a binary alphabet. If s = (s(n))(n0) and t = (t(n))(n = 0) are D0L sequences, their equality set E(s, t) is defined by E(s, t) = (n = 0 vertical bar s(n) = t(n)}. We show that if s and t are D0L sequences over a binary alphabet then their equality set E(s, t) is eventually peri0dic. (C) 2018 Elsevier B.V. All rights reserved.