Classification of Cellular Automata based on the Hamming distance

Abstract

Elementary cellular automata are the simplest form of cellular automata, studied extensively by Wolfram in the 1980s. He discovered complex behavior in some of these automata and developed a classification for all cellular automata based on their phenomenology. In this paper, we present an algorithm to classify them more effectively by measuring difference patterns using the Hamming distance. Our classification aligns with Wolfram's and further categorizes them into additional subclasses.