1. DSpace@RNLKWC
  2. Faculty Publications
  3. Articles
Please use this identifier to cite or link to this item: http://111.93.204.14:8080/xmlui/handle/123456789/611
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPattanayak, Anupam-
dc.contributor.authorDhal, Subhasish-
dc.date.accessioned2022-05-10T10:03:28Z-
dc.date.available2022-05-10T10:03:28Z-
dc.date.issued2019-01-
dc.identifier.urihttp://111.93.204.14:8080/xmlui/handle/123456789/611-
dc.description.abstractCellular automata (CA) is a computing model. Change of CA cells are governed by the CA rules 0 – 255. When cells of CA are subject to change synchronously then that CA is referred as synchronous CA. But when all the cells do not participate in the process of change synchronously is called Asynchronous CA (ACA). The most complex type of ACA is  – asynchronous Cellular Automata where all the cells changes according to a probability. Reversibility is one important issue where we check if it's possible for CA with any initial state to comeback to this initial state after some time steps. We have attempted to study the reversibility of  – asynchronous cellular automata in this work which is so far not reported in the literature.en_US
dc.language.isoenen_US
dc.publisherConference on Advancement in Computation, Communication and Electronics Paradigm (ACCEP -2019)en_US
dc.subjectCellular automataen_US
dc.subjectAsynchronous cellular automataen_US
dc.subjectReversibilityen_US
dc.titleReversibility of  – asynchronous Cellular Autotmata: A simulation-based studyen_US
dc.typeArticleen_US
Appears in Collections:Articles

Files in This Item:
File Description SizeFormat 
reversible rules of alpha-asynchrnous cellular automata paper for RKM vidyamandir 2019 final.pdf186.97 kBAdobe PDFView/Open
Show simple item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.