Answers are grounded in this paper and cite their sources.
The computation of a number of picture properties which involve connectivity and component counting is considered. The computational model consists of a one-dimensional array of finite-state automata which scans a digital picture, one row at a time, in one-pass. The inherent complexity of a picture property is reflected in the memory requirements of each element of the corresponding scanner and the number of neighboring automata with which it must communicate. A noncomputable property is presented.
No takes yet. Share an insight, caveat, or question.
Stanley M. Selkow (1972) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: