Characterization of Reachable/Nonreachable Cellular Automata States

DOI10.1007/978-3-540-30479-1_84MaRDI QIDQ5464178zbMATH OpenOpenAlexFDO

Authors Sukanta Das, Biplab K. Sikdar, P. Pal Chaudhuri

Publication date 17 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-30479-1_84

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Recommendations

• Characterization of Non-reachable States in Irreversible CA State Space
• Characterization of 1-d periodic boundary reversible CA
• scientific article; zbMATH DE number 7179993
• Decision Algorithms for Cellular Automata States Based on Periodic Boundary Condition
• Reachability problem in non-uniform cellular automata

Cited in

(11)

• Reachability problem in non-uniform cellular automata
• Characterization of single cycle CA and its application in pattern classification
• Characterization of 1-d periodic boundary reversible CA
• Classification of CA Rules Targeting Synthesis of Reversible Cellular Automata
• Characterization of Non-reachable States in Irreversible CA State Space
• Scalability of non-uniform cellular automata having only point state attractors
• A survey of cellular automata: types, dynamics, non-uniformity and applications
• Non-uniform number-conserving elementary cellular automata
• Invertible behavior in elementary cellular automata with memory
• Role delegation on multiple-attractor cellular automata based on pseudo-exhaustive bit patterns
• Non-linear and non-group cellular automata chaining technique for cryptographic applications

This page was built for publication: Characterization of Reachable/Nonreachable Cellular Automata States

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5464178)