The following pages link to (Q3802629):
Displayed 17 items.
- On Goles' universal machines: a computational point of view (Q393156) (← links)
- Bulking I: An abstract theory of bulking (Q549700) (← links)
- Four states are enough! (Q616491) (← links)
- Computation theoretic aspects of cellular automata (Q807035) (← links)
- Classifying circular cellular automata (Q807056) (← links)
- Complexity of reachability problems for finite discrete dynamical systems (Q856411) (← links)
- Synthesis, structure and power of systolic computations (Q913515) (← links)
- On totalistic systolic networks (Q1108796) (← links)
- Cellular automata, \(\omega{} \omega\)-regular sets, and sofic systems (Q1179180) (← links)
- Inducing an order on cellular automata by a grouping operation (Q1283794) (← links)
- A universal cellular automaton in quasi-linear time and its S-m-n form (Q1314380) (← links)
- Intrinsically universal \(n\)-dimensional quantum cellular automata (Q1757844) (← links)
- Partitioned quantum cellular automata are intrinsically universal (Q1761701) (← links)
- Theory of cellular automata: a survey (Q1779295) (← links)
- Universality and decidability of number-conserving cellular automata (Q1870564) (← links)
- Predecessor existence problems for finite discrete dynamical systems (Q2455591) (← links)
- Number-Conserving Reversible Cellular Automata and Their Computation-Universality (Q2773021) (← links)