Title of article
The Pagoda Sequence: a Ramble through Linear Complexity, NumberWalls, D0L Sequences, Finite State Automata, and Aperiodic Tilings
Author/Authors
Fred Lunnon، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
19
From page
130
To page
148
Abstract
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
Journal title
Electronic Proceedings in Theoretical Computer Science
Serial Year
2009
Journal title
Electronic Proceedings in Theoretical Computer Science
Record number
679679
Link To Document