Computations on one-dimensional cellular automata
From MaRDI portal
Publication:1817072
DOI10.1007/BF02127801zbMATH Open0860.68075MaRDI QIDQ1817072FDOQ1817072
Publication date: 1 December 1996
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- An 8-state minimal time solution to the firing squad synchronization problem
- One-way bounded cellular automata
- An optimum solution to the firing squad synchronization problem
- Signals in one-dimensional cellular automata
- Real-time language recognition by one-dimensional cellular automata
- Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
- Generation of Primes by a One-Dimensional Real-Time Iterative Array
- On real-time cellular automata and trellis automata
- A six-state minimal time solution to the Firing squad synchronization problem
- A linear speed-up theorem for cellular automata
Cited In (9)
- Title not available (Why is that?)
- Solving the parity problem in one-dimensional cellular automata
- On time computability of functions in one-way cellular automata
- Title not available (Why is that?)
- One-way cellular automata on Cayley graphs
- Leader election on two-dimensional periodic cellular automata
- Reversible space-time simulation of cellular automata
- Abstract geometrical computation. VIII: Small machines, accumulations \& rationality
- Shrinking One-Way Cellular Automata
Recommendations
This page was built for publication: Computations on one-dimensional cellular automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1817072)
