Generation of Pseudo-Isomorphic Cellular Automata

This paper explores isomorphism in one-dimensional finite cellular automata and introduces a new concept, named pseudo-isomorphism. An approach for generating pseudo-isomorphic cellular automata has been described here, that works by reversing cycles in the transition diagrams. Additionally, a new mathematical notion, named state-neighborhood relation has been introduced and is used to determine if a particular set of cycles in the transition diagram can be reversed to generate a pseudo-isomorphic cellular automaton.