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

MaRDI QIDQ5145156zbMATH OpenFDO

Authors Fred Lunnon

Publication date 20 January 2021

Full work available at URL https://arxiv.org/abs/0906.3286, http://eptcs.web.cse.unsw.edu.au/paper.cgi?CSP08.13

Mathematics Subject Classification ID

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

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

Cited in

(4)

• Combinatorics on number walls and the P(t)-adic Littlewood conjecture
• Counterexamples to the p(t)-adic Littlewood conjecture over small finite fields
• Discovery of exact equations via computing the Gröbner basis
• 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)