Pages that link to "Item:Q1884850"

The following pages link to Solution of some conjectures about topological properties of linear cellular automata (Q1884850):

Displaying 31 items.

• \(m\)-asynchronous cellular automata: from fairness to quasi-fairness (Q269781) (← links)
• Computation of functions on \(n\) bits by asynchronous clocking of cellular automata (Q272766) (← links)
• Solving the parity problem in one-dimensional cellular automata (Q272769) (← links)
• Multidimensional cellular automata: closing property, quasi-expansivity, and (un)decidability issues (Q385957) (← links)
• Sand piles: from physics to cellular automata models (Q428902) (← links)
• Three research directions in non-uniform cellular automata (Q475396) (← links)
• A family of sand automata (Q482286) (← links)
• Homogeneity of surjective cellular automata (Q556484) (← links)
• Periodic points for onto cellular automata (Q698668) (← links)
• Conservation of some dynamical properties for operations on cellular automata (Q837159) (← links)
• The topological pressure of linear cellular automata (Q845410) (← links)
• On the directional dynamics of additive cellular automata (Q1034602) (← links)
• On the Bernoulli automorphism of reversible linear cellular automata (Q1671768) (← 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)
• Asynchronous cellular automata and dynamical properties (Q2629937) (← links)
• Chaos and ergodicity are decidable for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\) (Q2666860) (← links)
• A survey on transitivity in discrete time dynamical systems. application to symbolic systems and related languages (Q3431444) (← links)
• Decidable Properties of 2D Cellular Automata (Q3533017) (← links)
• A complete and efficiently computable topological classification of D-dimensional linear cellular automata over Z m (Q4572007) (← links)
• Some Formal Properties of Asynchronous Cellular Automata (Q4931236) (← links)
• Additive Cellular Automata Over Finite Abelian Groups: Topological and Measure Theoretic Properties (Q5092431) (← links)
• Decidable characterizations of dynamical properties for additive cellular automata over a finite abelian group with applications to data encryption (Q6064475) (← links)
• Efficient methods with polynomial complexity to determine the reversibility of general 1D linear cellular automata over \(\mathbb{Z}_p\) (Q6118641) (← links)
• The impact of alphabet size on pattern complexity of maxmin-\( \omega\) cellular automata (Q6151170) (← links)
• A survey of cellular automata: types, dynamics, non-uniformity and applications (Q6151179) (← links)
• Effective Projections on Group Shifts to Decide Properties of Group Cellular Automata (Q6154975) (← links)
• An efficient algorithm deciding chaos for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\) with applications to data encryption (Q6179977) (← links)
• Computing the periods of preimages in surjective cellular automata (Q6191202) (← links)