Pages that link to "Item:Q1575952"

The following pages link to Ergodicity, transitivity, and regularity for linear cellular automata over \(\mathbb{Z}_m\) (Q1575952):

Displaying 19 items.

• A family of sand automata (Q482286) (← links)
• The topological pressure of linear cellular automata (Q845410) (← links)
• On the directional dynamics of additive cellular automata (Q1034602) (← links)
• On the dynamical behavior of chaotic cellular automata (Q1285792) (← links)
• Attractors of linear cellular automata (Q1307699) (← links)
• On computing the entropy of cellular automata. (Q1401183) (← links)
• On the Bernoulli automorphism of reversible linear cellular automata (Q1671768) (← links)
• Theory of cellular automata: a survey (Q1779295) (← links)
• Solution of some conjectures about topological properties of linear cellular automata (Q1884850) (← links)
• A complete and efficiently computable topological classification of D-dimensional linear cellular automata over \(Z_{m}\) (Q1960524) (← links)
• Dynamical behavior of additive cellular automata over finite abelian groups (Q2003993) (← links)
• On the dynamical behaviour of linear higher-order cellular automata and its decidability (Q2215107) (← links)
• An efficiently computable characterization of stability and instability for linear cellular automata (Q2229949) (← links)
• The measure-theoretic entropy and topological entropy of actions over \(\mathbb{Z}_m\) (Q2337039) (← links)
• Chaos and ergodicity are decidable for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\) (Q2666860) (← links)
• Decidability and undecidability in cellular automata (Q2869780) (← links)
• Additive Cellular Automata Over Finite Abelian Groups: Topological and Measure Theoretic Properties (Q5092431) (← links)
• Classifying 1D elementary cellular automata with the 0-1 test for chaos (Q6111904) (← links)
• The impact of alphabet size on pattern complexity of maxmin-\( \omega\) cellular automata (Q6151170) (← links)