Equality sets of binary D0L sequences



: Juha Honkala

Publisher: Elsevier

: 2018

: Theoretical Computer Science

: THEORETICAL COMPUTER SCIENCE

: THEOR COMPUT SCI

: 740

: 63

: 67

: 5

: 0304-3975

: 1879-2294

DOI: https://doi.org/10.1016/j.tcs.2018.05.011


We study D0L sequences over a binary alphabet. If s = (s(n))(n>0) 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.



Last updated on 2024-26-11 at 12:08