Automatic sequences and numeration systems

k-automatic and k-regular sequences, Cobham's theorem and kernels, meta-automatic sequences, results proved with the Walnut prover, and numeration systems (Dumont–Thomas, Tribonacci and Zeckendorf representations) whose digit words define such sequences.

• Automatic sequences
• Christol's theorem
• Dumont–Thomas numeration
• Regular sequences
• Meta-automatic sequences
• Irvine's conjecture on Kimberling's word
• Tribonacci representations and the Trithoff array

The dependency explorer needs JavaScript and its graph data.

Download the complete graph data.