Characterization of 1-d Periodic Boundary Reversible CA

DOI10.1016/j.entcs.2009.09.022zbMath1338.68179OpenAlexW2101516086MaRDI QIDQ2811961

Biplab Sikdar, Sukanta Das

Publication date: 9 June 2016

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2009.09.022

zbMATH Keywords

non-uniform cellular automataperiodic boundaryreachability treereversible CArule class

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items (3)

CYCLES OF CHARACTERISTIC MATRICES OF CELLULAR AUTOMATA WITH PERIODIC BOUNDARY CONDITION ⋮ A survey of cellular automata: types, dynamics, non-uniformity and applications ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Invertible cellular automata: A review
• On the dynamical behavior of chaotic cellular automata
• Zero-dimensional dynamical systems, formal languages, and universality
• Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
• Classification of CA Rules Targeting Synthesis of Reversible Cellular Automata
• Statistical mechanics of cellular automata
• Shorter Note: The Converse of Moore's Garden-of-Eden Theorem
• Characterization of Reachable/Nonreachable Cellular Automata States

This page was built for publication: Characterization of 1-d Periodic Boundary Reversible CA