Pages that link to "Item:Q2666860"
From MaRDI portal
The following pages link to Chaos and ergodicity are decidable for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\) (Q2666860):
Displayed 5 items.
- Dynamical behavior of additive cellular automata over finite abelian groups (Q2003993) (← links)
- Random expansion method for the generation of complex cellular automata (Q2666780) (← links)
- Efficient methods with polynomial complexity to determine the reversibility of general 1D linear cellular automata over \(\mathbb{Z}_p\) (Q6118641) (← links)
- Asynchronous communicating cellular automata: formalization, robustness and equivalence (Q6154787) (← links)
- An efficient algorithm deciding chaos for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\) with applications to data encryption (Q6179977) (← links)
