Pages that link to "Item:Q6064475"

The following pages link to Decidable characterizations of dynamical properties for additive cellular automata over a finite abelian group with applications to data encryption (Q6064475):

Displaying 5 items.

• An efficiently computable characterization of stability and instability for linear cellular automata (Q2229949) (← links)
• Efficient methods with polynomial complexity to determine the reversibility of general 1D linear cellular automata over \(\mathbb{Z}_p\) (Q6118641) (← links)
• An efficient algorithm deciding chaos for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\) with applications to data encryption (Q6179977) (← links)
• Identification of Periodic Boundary SACA Rules Exploring NSRT Diagram (Q6488208) (← links)
• Easy to check algebraic characterizations of dynamical properties for linear CA and additive CA over a finite abelian group (Q6637835) (← links)