宝塔序列：漫谈线性复杂度、数字墙、D0L序列、有限状态自动机和非周期性拼接
The Pagoda Sequence: a Ramble through Linear Complexity, Number Walls, D0L Sequences, Finite State Automata, and Aperiodic Tilings
摘要：
我们回顾了数字墙的概念，作为传统的线性复杂性配置文件（LCP）的替代品，并勾勒出与其他主题，如线性反馈移位寄存器（LFSR）和上下文无关的Lindenmayer（D 0 L）序列的关系。一个显着的三进制模拟的Thue-Morse序列引入了不足2模3，并通过重新解释的数墙作为一个非周期性的平面平铺验证了这一属性。
英文摘要：
We review the concept of the number wall as an alternative to the traditional linear complexity profile (LCP), and sketch the relationship to other topics such as linear feedback shift-register (LFSR) and context-free Lindenmayer (D0L) sequences. A remarkable ternary analogue of the Thue-Morse sequence is introduced having deficiency 2 modulo 3, and this property verified via the re-interpretation of the number wall as an aperiodic plane tiling.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
