Home On the structure of the set of reversible cellular automata
Article
Licensed
Unlicensed Requires Authentication

On the structure of the set of reversible cellular automata

  • I. V. Kucherenko
Published/Copyright: December 10, 2007
Become an author with De Gruyter Brill
Discrete Mathematics and Applications
From the journal Volume 17 Issue 5

We investigate the structure of the set of reversible cellular automata. In the class of two-dimensional binary linear cellular automata with variable structure, the classes with decidable and undecidable reversibility property are separated, which contain almost all such cellular automata. With the use of this result, we prove undecidability of reversibility in the class of cellular automata with Γ-pattern and sixteen states of a cell and in the class of two-dimensional binary cellular automata with self-dual local transition functions. The complete description is given for the structure of the set of reversible cellular automata of the class of binary cellular automata with local transition functions from the Post classes.

Received: 2005-November-22
Published Online: 2007-12-10
Published in Print: 2007-12-11

© de Gruyter

Downloaded on 19.9.2025 from https://www.degruyterbrill.com/document/doi/10.1515/dma.2007.039/html
Scroll to top button