2012 | OriginalPaper | Buchkapitel
Counting Cycles in Reversible Cellular Automata
verfasst von : Sukanta Das, Avik Chakraborty, Biplab K. Sikdar
Erschienen in: Cellular Automata
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
This paper reports characterization of 1-D cellular automata (CA) state space to count the cycles of reversible CA. The reachability tree provides theoretical framework to identify number of cycles in reversible CA. However, we concentrate here on a special class of reversible CA that follow
right independence
property. The right independence property implies, the cells of CA are independent of right neighbor. To our knowledge, no work till now has been done to find the number cycles of reversible CA by analyzing the CA state space.