EQUALITY SETS OF MORPHIC WORD SEQUENCES

: Honkala J

Publisher: WORLD SCIENTIFIC PUBL CO PTE LTD

: 2012

: International Journal of Foundations of Computer Science

: INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE

: INT J FOUND COMPUT S

: 8

: 23

: 8

: 1749

: 1766

: 18

: 0129-0541

DOI: https://doi.org/10.1142/S0129054112500268

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.