Rule vector graph (RVG) to design linear time algorithm for identifying the invertibility of periodic-boundary three neighborhood cellular automata
From MaRDI portal
Publication:5396367
zbMATH Open1280.68131MaRDI QIDQ5396367FDOQ5396367
Authors: Nirmalya Sundar Maiti, Soumyabrata Ghosh, Biplab K. Sikdar, P. Pal Chaudhuri 
Publication date: 5 February 2014
Recommendations
- Linear time algorithm for identifying the invertibility of null-boundary three neighborhood cellular automata
- On invertible three neighborhood null-boundary uniform cellular automata
- On invertible three neighborhood null-boundary uniform cellular automata
- Graph-theoretical characterization of invertible cellular automata
- On reversibility of cellular automata with periodic boundary conditions
rule min termrule vector graph (RVG)elemenaty group ruleshybrid CAinvertible CAnon-reachable states (NRSs)periodic boundary CAuniform CA
Cited In (4)
- An analytical framework for characterizing restricted two dimensional cellular automata evolution
- Linear time algorithm for identifying the invertibility of null-boundary three neighborhood cellular automata
- On invertible three neighborhood null-boundary uniform cellular automata
- On invertible three neighborhood null-boundary uniform cellular automata
This page was built for publication: Rule vector graph (RVG) to design linear time algorithm for identifying the invertibility of periodic-boundary three neighborhood cellular automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5396367)
