Extracting cellular automaton rules directly from experimental data
Cellular automata
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Cellular Automata
Universality in cellular automata
SWAT '70 Proceedings of the 11th Annual Symposium on Switching and Automata Theory (swat 1970)
On the Evolution of Hardware Circuits via Reconfigurable Architectures
ACM Transactions on Reconfigurable Technology and Systems (TRETS)
Hi-index | 0.00 |
Cellular Automata architectures are attractive due to their fine grain parallelism, simple computational structures and local routing resources. Some researchers have used genetic algorithms to find CA that perform useful computations. The inherently parallel cellular automata model as well as the genetic algorithm are poorly suited to implementation on general purpose microprocessor based systems. Field Programmable Gate Arrays are an alternative that can provide significant speedup. This paper describes the Xilinx XC6216 Field Programmable Gate Array and how it is used to efficiently search a hybrid 2-state, 5- neighbour cellular automata rule space that exhibits computation universality. Its application to an image processing application, binary texture analysis, is discussed.