Representation of Events in the von Neumann Cellular Model

Authors:
Amar Mukhopadhyay
Affiliations:
Montana State University, Electrical Engineering Department, Bozeman, Montana
Venue:
Journal of the ACM (JACM)
Year:
1968

Citing 0
Cited 3

How a SIMD machine can implement a complex cellular automata? a case study: von Neumann's 29-state cellular automaton

Proceedings of the 1989 ACM/IEEE conference on Supercomputing
A Universal Four-State Cellular Computer

IEEE Transactions on Computers
Constructibility of signal-crossing solutions in von neumann 29-state cellular automata

ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part II

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper it is proved that regular events are representable in the cellular model proposed by John von Neumann, and a construction of a finite-state cellular automaton is presented. The procedure was motivated primarily by McNaughton's construction of an automaton using slow but well-timed elements.