Complexité et automates cellulaires linéaires
From MaRDI portal
Publication:2720412
DOI10.1051/ita:2000124zbMath0988.68116OpenAlexW2162957125MaRDI QIDQ2720412
Publication date: 9 April 2002
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1051/ita:2000124
Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorics on words (68R15) Cellular automata (computational aspects) (68Q80) Automata sequences (11B85)
Related Items
How to prove that a sequence is not automatic ⋮ Line complexity asymptotics of polynomial cellular automata ⋮ The density of 0's in recurrence double sequences. ⋮ Automaticity and Invariant Measures of Linear Cellular Automata ⋮ Random matrix products and applications to cellular automata
