EQUALITY SETS OF MORPHIC WORD SEQUENCES

作者：Honkala Juha^*

来源：International Journal of Foundations of Computer Science, 2012, 23(8): 1749-1766.

DOI：10.1142/S0129054112500268

• Equality set
• DOL sequence
• HD0L sequence
• periodicity
• decidability

We study equality sets of mappings, In particular, we study D0L equality sets, If s = (s(n)n %26gt;= 0 and t = (t(n))n %26gt;= 0 are D0L sequences, their equality set is defined by E (s,t) = {n %26gt;= 0\ s(n) = t (n)}. We study various periodicity and decidability questions concerning these sets. We also study HD0L and DT0L equality sets.

• 出版日期2012-12