A1 Refereed original research article in a scientific journal
Equality sets of binary D0L sequences
Authors: Juha Honkala
Publisher: Elsevier
Publication year: 2018
Journal: Theoretical Computer Science
Journal name in source: THEORETICAL COMPUTER SCIENCE
Journal acronym: THEOR COMPUT SCI
Volume: 740
First page : 63
Last page: 67
Number of pages: 5
ISSN: 0304-3975
eISSN: 1879-2294
DOI: https://doi.org/10.1016/j.tcs.2018.05.011
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 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.
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.
UTU Research Portal