Login / Signup
An efficiently computable characterization of stability and instability for linear cellular automata.
Alberto Dennunzio
Enrico Formenti
Darij Grinberg
Luciano Margara
Published in:
J. Comput. Syst. Sci. (2021)
Keyphrases
</>
cellular automata
efficiently computable
cellular automaton
upper bound
sufficient conditions
computationally hard
pattern formation
lattice gas
cellular automata model
cellular automaton model
discrete dynamical systems
traffic flow
chaotic dynamics
search space
galois field