The Pagoda sequence: a ramble through linear complexity, number walls, D0L sequences, finite state automata, and aperiodic tilings

zbMATH Open1455.68154arXiv0906.3286MaRDI QIDQ5145156FDOQ5145156

Authors: Fred Lunnon 

Publication date: 20 January 2021

Full work available at URL: https://arxiv.org/abs/0906.3286

Recommendations

• Perfect linear complexity profile and apwenian sequences
• The Linus sequence
• Automatic Sequences
• ON INTEGER SEQUENCES GENERATED BY LINEAR MAPS
• Linear cellular automata, finite automata and Pascal's triangle

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Combinatorics on words (68R15) Tilings in (2) dimensions (aspects of discrete geometry) (52C20)

Cited In (1)

• On the \(t\)-adic Littlewood conjecture

This page was built for publication: The Pagoda sequence: a ramble through linear complexity, number walls, D0L sequences, finite state automata, and aperiodic tilings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145156)