The Pagoda Sequence: a Ramble through Linear Complexity, Number Walls, D0L Sequences, Finite State Automata, and Aperiodic Tilings

The Pagoda Sequence: a Ramble through Linear Complexity, Number Walls, D0L Sequences, Finite State Automata, and Aperiodic Tilings

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 seque...

Full description

Bibliographic Details
Main Author: Fred Lunnon
Format: Article
Language:English
Published: Open Publishing Association 2009-06-01
Series:Electronic Proceedings in Theoretical Computer Science
Online Access:http://arxiv.org/pdf/0906.3286v1
id doaj-50c46a9aa3454e14af278834b6541080
record_format Article
spelling doaj-50c46a9aa3454e14af278834b65410802020-11-24T22:33:42ZengOpen Publishing AssociationElectronic Proceedings in Theoretical Computer Science2075-21802009-06-011Proc. CSP 200813014810.4204/EPTCS.1.13The Pagoda Sequence: a Ramble through Linear Complexity, Number Walls, D0L Sequences, Finite State Automata, and Aperiodic TilingsFred LunnonWe 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. http://arxiv.org/pdf/0906.3286v1
collection DOAJ
language English
format Article
sources DOAJ
author Fred Lunnon
spellingShingle Fred Lunnon
The Pagoda Sequence: a Ramble through Linear Complexity, Number Walls, D0L Sequences, Finite State Automata, and Aperiodic Tilings
Electronic Proceedings in Theoretical Computer Science
author_facet Fred Lunnon
author_sort Fred Lunnon
title The Pagoda Sequence: a Ramble through Linear Complexity, Number Walls, D0L Sequences, Finite State Automata, and Aperiodic Tilings
title_short The Pagoda Sequence: a Ramble through Linear Complexity, Number Walls, D0L Sequences, Finite State Automata, and Aperiodic Tilings
title_full The Pagoda Sequence: a Ramble through Linear Complexity, Number Walls, D0L Sequences, Finite State Automata, and Aperiodic Tilings
title_fullStr The Pagoda Sequence: a Ramble through Linear Complexity, Number Walls, D0L Sequences, Finite State Automata, and Aperiodic Tilings
title_full_unstemmed The Pagoda Sequence: a Ramble through Linear Complexity, Number Walls, D0L Sequences, Finite State Automata, and Aperiodic Tilings
title_sort pagoda sequence: a ramble through linear complexity, number walls, d0l sequences, finite state automata, and aperiodic tilings
publisher Open Publishing Association
series Electronic Proceedings in Theoretical Computer Science
issn 2075-2180
publishDate 2009-06-01
description 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.
url http://arxiv.org/pdf/0906.3286v1
work_keys_str_mv AT fredlunnon thepagodasequencearamblethroughlinearcomplexitynumberwallsd0lsequencesfinitestateautomataandaperiodictilings
AT fredlunnon pagodasequencearamblethroughlinearcomplexitynumberwallsd0lsequencesfinitestateautomataandaperiodictilings
_version_ 1725729811030081536

Similar Items