Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request

Complexity of Substitutive Sequences - Calculation of the Complexities of Substitutive Sequences Over a Binary Alphabet

Item request has been placed! ×
Item request cannot be made. ×
loading   Processing Request
اقرأ أكثر حفظ في قائمتي
  • معلومة اضافية
    • الموضوع:
      2015
    • Collection:
      Computer Science
      Mathematics
    • نبذة مختصرة :
      We consider the complexities of substitutive sequences over a binary alphabet. By studying various types of special words, we show that, knowing some initial values, its complexity can be completely formulated via a recurrence formula determined by the characteristic polynomial.
      Comment: 16 pages
    • الرقم المعرف:
      edsarx.1507.03058