Article ID Journal Published Year Pages File Type
6875406 Theoretical Computer Science 2018 5 Pages PDF
Abstract
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|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 periodic.
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Authors
,