A limit theorem for pattern synthesis in image processing
We prove two mixed limit theorems for pattern synthesis, one for linear and one for cyclic connection graphs. This extends an earlier result for linear graphs in that it shows that the acceptor function need only satisfy weak conditions for the limits to exist.