A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
Equality sets of binary D0L sequences
Tekijät: Juha Honkala
Kustantaja: Elsevier
Julkaisuvuosi: 2018
Journal: Theoretical Computer Science
Tietokannassa oleva lehden nimi: THEORETICAL COMPUTER SCIENCE
Lehden akronyymi: THEOR COMPUT SCI
Vuosikerta: 740
Aloitussivu: 63
Lopetussivu: 67
Sivujen määrä: 5
ISSN: 0304-3975
eISSN: 1879-2294
DOI: https://doi.org/10.1016/j.tcs.2018.05.011
Tiivistelmä
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.
Turun yliopiston Tutkimustietojärjestelmän portaali