Pages that link to "Item:Q2666860"

The following pages link to Chaos and ergodicity are decidable for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\) (Q2666860):

Displaying 8 items.

• Ergodic characterization of linear cellular automata over \(Z_{m}\) (Q1275074) (← links)
• Dynamical behavior of additive cellular automata over finite abelian groups (Q2003993) (← links)
• Random expansion method for the generation of complex cellular automata (Q2666780) (← links)
• On ergodic linear cellular automata over Zm (Q5048943) (← 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)
• Easy to check algebraic characterizations of dynamical properties for linear CA and additive CA over a finite abelian group (Q6637835) (← links)