scientific article; zbMATH DE number 7339755
From MaRDI portal
Publication:4986309
Recommendations
- Solving the parity problem in one-dimensional cellular automata
- The Nilpotency Problem of One-Dimensional Cellular Automata
- scientific article; zbMATH DE number 2113947
- On decidability properties of one-dimensional cellular automata
- Improvement of a result on sequencing elementary cellular automata rules for solving the parity problem
- On the conjugacy problem of cellular automata
- Computations on one-dimensional cellular automata
- scientific article; zbMATH DE number 1962850
- Problem solving on one-bit-communication cellular automata
- scientific article; zbMATH DE number 1985715
Cited in
(10)- A perfect solution to the parity problem with elementary cellular automaton 150 under asynchronous update
- Solutions to all-colors problem on graph cellular automata
- Solving the parity problem in one-dimensional cellular automata
- Improvement of a result on sequencing elementary cellular automata rules for solving the parity problem
- scientific article; zbMATH DE number 4085033 (Why is no real title available?)
- Computing modulo-\(n\) by composing cellular automata rules
- Mining a class of decision problems for one-dimensional cellular automata
- Solving the parity problem with rule 60 in array size of the power of two
- Synchronous solution of the parity problem on cyclic configurations, with elementary cellular automaton rule 150, over a family of directed, non-circulant, regular graphs
- Asynchronous cellular systems that solve the parity problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4986309)
