Rule vector graph (RVG) to design linear time algorithm for identifying the invertibility of periodic-boundary three neighborhood cellular automata

MaRDI QIDQ5396367zbMATH OpenFDO

Authors Nirmalya Sundar Maiti, Soumyabrata Ghosh, Biplab K. Sikdar, P. Pal Chaudhuri

Publication date 5 February 2014

zbMATH Keywords

elemenaty group ruleshybrid CAinvertible CAnon-reachable states (NRSs)periodic boundary CArule min termrule vector graph (RVG)uniform CA

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

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

Cited in

(4)

• An analytical framework for characterizing restricted two dimensional cellular automata evolution
• On invertible three neighborhood null-boundary uniform cellular automata
• On invertible three neighborhood null-boundary uniform cellular automata
• Linear time algorithm for identifying the invertibility of null-boundary three neighborhood 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)