Analo Combinatorics and Cellular Automata - Eey Algorithms and Layout Design
Pkter L. Venetianer, Kenneth R. Crounset · 1994
This paper demonstrates how certain logic .and combinatorial tasks can be solved using CNNs. The most important application generalizes a shortest path algorithm to design the layout of printed circuit boards. Besides, it is shown how cellular automata can be simulated on CNN, and tasks, such as sorting, parity analysis, histogram calculation of black-and-white images, and computing minimum Hamming distance are also solved.