An algorithm for testing permutativeness of cellular automata

An effective procedure for deciding permutativeness of one-directional cellular automata on the one-sided full shift is presented. It is then implemented in C++, and used to test permutativeness of elementary cellular automata (those of radius 3).