One-Pass Complexity of Digital Picture Properties

The computa t ion of a number of picture propert ies which involve connect iv i ty and component count ing is considered. The computa t iona l model consists of a one-dimensional array of f ini te-state a u t o m a t a which scans a digital picture, one row at a t ime, in one-pass. The inheren t complexity of a picture proper ty is reflected in the memory requi rements of each element of the corresponding scanner and the number of neighbor ing a u t o m a t a wi th which it mus t communicate . A noncomputab le proper ty is presented.