A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
D0L sequences and their equality sets
Tekijät: Honkala Juha
Kustantaja: IOS Press
Julkaisuvuosi: 2017
Journal: Fundamenta Informaticae
Tietokannassa oleva lehden nimi: Fundamenta Informaticae
Vuosikerta: 154
Numero: 1-4
Aloitussivu: 201
Lopetussivu: 206
Sivujen määrä: 6
ISSN: 0169-2968
eISSN: 1875-8681
DOI: https://doi.org/10.3233/FI-2017-1561
We study D0L sequences and their equality sets. If s = (s(n))n≥0 and t = (t(n))n≥0 are D0L sequences, their equality set is defined by E(s, t) = {n ≥ 0 | s(n) = t(n)}. It is an open problem whether such equality sets are always eventually periodic. Using methods developed by Ehrenfeucht and Rozenberg we show that a D0L equality set is eventually periodic if it contains at least one infinite arithmetic progression. As a main tool we use elementary morphisms introduced by Ehrenfeucht and Rozenberg.