Pages that link to "Item:Q1376426"
From MaRDI portal
The following pages link to Predicting nonlinear cellular automata quickly by decomposing them into linear ones (Q1376426):
Displaying 12 items.
- Replication in one-dimensional cellular automata (Q720714) (← links)
- The complexity of small universal Turing machines: A survey (Q1004087) (← links)
- Circuits and expressions with nonassociative gates (Q1567406) (← links)
- Graph-theoretical characterization of invertible cellular automata (Q1581757) (← links)
- Evaluation of circuits over nilpotent and polycyclic groups (Q1750355) (← links)
- Efficient exhaustive listings of reversible one dimensional cellular automata (Q1884849) (← links)
- Mutually orthogonal Latin squares based on cellular automata (Q2291667) (← links)
- Pre-expansivity in cellular automata (Q2306015) (← links)
- Algebraic properties of some quadratic dynamical systems (Q2490018) (← links)
- Unraveling simplicity in elementary cellular automata (Q2628772) (← links)
- The Complexity of Small Universal Turing Machines: A Survey (Q2891384) (← links)
- Theory of Composing Non-linear Machines with Predictable Cyclic Structures (Q3541766) (← links)
