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.

中文翻译：

---

关于类Rudin-Shapiro序列的第N个最大阶复杂度和扩展复杂度

基于整数的二进制表示中作为分散子序列的模式10出现次数的奇偶性，Lafrance，Rampersad和Yee定义了类似Rudin-Shapiro的序列。本文计算了该类Rudin-Shapiro序列的第N个最大阶复杂度和扩展复杂度。