On the Nth maximum order complexity and the expansion complexity of a Rudin-Shapiro-like sequence

• DOI: 10.1007/s12095-019-00396-0
• Publication Date: 2019-09-13T04:31:08Z
• Authors: Zhimin Sun; Xiangyong Zeng; Da Lin
• Keywords: 0102 computer and information sciences; 01 natural sciences

Based on the parity of the number of occurrences of a pattern 10 as a scattered subsequence in the binary representation of integers, a Rudin-Shapiro-like sequence is defined by Lafrance, Rampersad and Yee. The N th maximum order complexity and the expansion complexity of this Rudin-Shapiro-like sequence are calculated in this paper.