Pascal's triangle, complexity and automata

zbMath0922.11012MaRDI QIDQ1280222

Jean-Paul Allouche, Valérie Berthé

Publication date: 14 March 1999

Published in: Bulletin of the Belgian Mathematical Society - Simon Stevin (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/119948

zbMATH Keywords

cellular automatafinite automatacomplexity of infinite sequences

Mathematics Subject Classification ID

Binomial coefficients; factorials; (q)-identities (11B65) Combinatorics on words (68R15) Cellular automata (computational aspects) (68Q80) Automata sequences (11B85) Sequences (mod (m)) (11B50)

Related Items (14)

How to prove that a sequence is not automatic ⋮ On the joint subword complexity of automatic sequences ⋮ Generalized Pascal triangle for binomial coefficients of words ⋮ On subword decomposition and balanced polynomials ⋮ On digital sequences associated with Pascal's triangle ⋮ The density of 0's in recurrence double sequences. ⋮ Automaticity and Invariant Measures of Linear Cellular Automata ⋮ On some questions regarding \(k\)-regular and \(k\)-context-free sequences ⋮ From Combinatorial Games to Shape-Symmetric Morphisms ⋮ On the subword complexity of Thue-Morse polynomial extractions ⋮ Combinatorics of words and morphisms in some pieces of Tom Johnson ⋮ Asymptotic subword complexity of fixed points of group substitutions ⋮ The distribution of elements in automatic double sequences ⋮ Symmetric patterns in the cellular automaton that generates Pascal's triangle modulo 2

This page was built for publication: Pascal's triangle, complexity and automata