Showing papers by "Charles R. Dyer published in 1978"
01 Nov 1978
TL;DR: A cellular analog to the tape-bounded Turing machine for bounded cellular, pyramid cellular, and parallel/sequential automata is defined, showing the increased capabilities of these machines for executing a variety of basic image analysis and recognition tasks.
Abstract: : This paper generalizes cellular automata by allowing the memory size associated with each cell to be a function of the input size. In particular, we define a cellular analog to the tape-bounded Turing machine for bounded cellular, pyramid cellular, and parallel/sequential automata. We focus on the case in which each cell has memory size proportional to the logarithm of the input size, showing the increased capabilities of these machines for executing a variety of basic image analysis and recognition tasks. (Author)
6 citations