This paper introduces a generalization of cellular automata in which each celi is a tape-bounded Turing machine rather than a finite-state machine. Fast algorithms are given for performing various basic image processing tasks by such automata. It is suggested that this model of parallel computation is a very suitable one for studying the advantages of parallelism in this domain.
No takes yet. Share an insight, caveat, or question.
Dyer et al. (1981) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: