The following pages link to (Q4357204):
Displaying 34 items.
- \(m\)-asynchronous cellular automata: from fairness to quasi-fairness (Q269781) (← links)
- Explicit routing schemes for implementation of cellular automata on processor arrays (Q272775) (← links)
- An improved multiple-attractor cellular automata classifier with a tree frame based on CART (Q316282) (← links)
- Multidimensional cellular automata: closing property, quasi-expansivity, and (un)decidability issues (Q385957) (← links)
- Three research directions in non-uniform cellular automata (Q475396) (← links)
- Reversibility of linear cellular automata (Q545985) (← links)
- On the relationship between fuzzy and Boolean cellular automata (Q627168) (← links)
- On binary circle plus operator \(\oplus\)-NFAs and succinct descriptions of regular languages (Q703507) (← links)
- Non-uniform cellular automata: classes, dynamics, and decidability (Q714501) (← links)
- Conservation of some dynamical properties for operations on cellular automata (Q837159) (← links)
- Permutation and sampling with maximum length CA or pseudorandom number generation (Q870167) (← links)
- Role delegation on multiple-attractor cellular automata based on pseudo-exhaustive bit patterns (Q884603) (← links)
- A multisecret sharing scheme for color images based on cellular automata (Q955248) (← links)
- Non-linear and non-group cellular automata chaining technique for cryptographic applications (Q988464) (← links)
- Attractors of linear cellular automata (Q1307699) (← links)
- Behavior of complemented CA whose complement vector is acyclic in a linear TPMACA. (Q1410658) (← links)
- Analysis of complemented CA derived from a linear TPMACA. (Q1416428) (← links)
- Error correcting codes via reversible cellular automata over finite fields (Q1639815) (← links)
- Reversibility of general 1D linear cellular automata over the binary field \(\mathbb{Z}_2\) under null boundary conditions (Q1750043) (← 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)
- A closed formula for the inverse of a reversible cellular automaton with \((2 R + 1)\)-cyclic rule (Q2009571) (← links)
- (Imperfect) strategies to generate primitive polynomials over GF(2) (Q2034772) (← links)
- Design of fault-resilient S-boxes for AES-like block ciphers (Q2040333) (← links)
- Reachability problem in non-uniform cellular automata (Q2053879) (← links)
- CYCLES OF CHARACTERISTIC MATRICES OF CELLULAR AUTOMATA WITH PERIODIC BOUNDARY CONDITION (Q5041830) (← links)
- (Q5240552) (← links)
- Symbolic Computation Using Cellular Automata-Based Hyperdimensional Computing (Q5380358) (← links)
- Replication of spatial patterns with reversible and additive cellular automata (Q5872741) (← 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)
- Virtual cyclic cellular automata, finite group actions and recursive properties (Q6195446) (← links)
- CLOUDS IN THE BASINS OF FULLY ASYNCHRONOUS CELLULAR AUTOMATA (Q6203390) (← links)
- Non-uniform number-conserving elementary cellular automata (Q6496149) (← links)
