Otro
Elementary cellular automaton rules by gray code
Autor
Schreiber, Michael
Resumen
Knowledge about: Cellular Automata, Coding Theory, Combinatorics, Data Structures, Discrete Mathematics, Discrete Models and Representations of Numbers Neighboring tiles evolve according to elementary cellular automaton rules that differ by one bit if Gray ordering is selected. Compare the 256 results for all elementary rules obtained from selected initial conditions of width nine. The initial conditions can be selected by ordinary enumeration order or by Gray code order, in which neighboring initializations differ by exactly one bit Componente Curricular::Educação Superior::Ciências Exatas e da Terra::Matemática