A1 Refereed original research article in a scientific journal
EQUALITY SETS OF MORPHIC WORD SEQUENCES
Authors: Honkala J
Publisher: WORLD SCIENTIFIC PUBL CO PTE LTD
Publication year: 2012
Journal: International Journal of Foundations of Computer Science
Journal name in source: INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE
Journal acronym: INT J FOUND COMPUT S
Number in series: 8
Volume: 23
Issue: 8
First page : 1749
Last page: 1766
Number of pages: 18
ISSN: 0129-0541
DOI: https://doi.org/10.1142/S0129054112500268
Abstract
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.
UTU Research Portal