Complexity and linear cellular automata

DOI10.1051/ITA:2000124MaRDI QIDQ2720412zbMATH OpenOpenAlexFDO

Authors Valérie Berthé

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

zbMATH Keywords

linear cellular automaton

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Automata sequences (11B85) Cellular automata (computational aspects) (68Q80) Combinatorics on words (68R15)

Recommendations

• Line complexity asymptotics of polynomial cellular automata
• Linear cellular automata over \(Z_ m\)
• scientific article; zbMATH DE number 1665453
• Linear cellular automata, finite automata and Pascal's triangle
• Linear cellular automata and recurring sequences in finite fields

Cited in

(10)

• The density of 0's in recurrence double sequences.
• Line complexity asymptotics of polynomial cellular automata
• How to prove that a sequence is not automatic
• Random matrix products and applications to cellular automata
• Complexity analysis of time series generated by elementary cellular automata
• scientific article; zbMATH DE number 1665453 (Why is no real title available?)
• scientific article; zbMATH DE number 17562 (Why is no real title available?)
• scientific article; zbMATH DE number 1462667 (Why is no real title available?)
• Automaticity and invariant measures of linear cellular automata
• Computational complexity of dynamical systems: the case of cellular automata

This page was built for publication: Complexity and linear cellular automata

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