| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4625109 | Advances in Applied Mathematics | 2009 | 8 Pages |
Abstract
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).
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
