Computations on iterative automata
Computations on iterative automata
Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
IEEE Transactions on Computers
Progress in Picture Processing: 1969--71
ACM Computing Surveys (CSUR)
On Some Open Problems in the Theory of Cellular Automata
IEEE Transactions on Computers
| Hi-index | 14.98 |
A procedure is given for the construction of a von Neumann neighborhood iterative array to simulate a Moore neighborhood array in real time for the cases of up to three-dimensional arrays. The increase in the typical machine complexity accompanying this neighborhood complexity reduction is significantly less than that found in the general n-dimensional study of Cole [1].