A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
EQUALITY SETS OF MORPHIC WORD SEQUENCES
Tekijät: Honkala J
Kustantaja: WORLD SCIENTIFIC PUBL CO PTE LTD
Julkaisuvuosi: 2012
Journal: International Journal of Foundations of Computer Science
Tietokannassa oleva lehden nimi: INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE
Lehden akronyymi: INT J FOUND COMPUT S
Numero sarjassa: 8
Vuosikerta: 23
Numero: 8
Aloitussivu: 1749
Lopetussivu: 1766
Sivujen määrä: 18
ISSN: 0129-0541
DOI: https://doi.org/10.1142/S0129054112500268
Tiivistelmä
We study equality sets of mappings, In particular, we study D0L 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)}. We study various periodicity and decidability questions concerning these sets. We also study HD0L and DT0L equality sets.
We study equality sets of mappings, In particular, we study D0L 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)}. We study various periodicity and decidability questions concerning these sets. We also study HD0L and DT0L equality sets.
Turun yliopiston Tutkimustietojärjestelmän portaali