Reversibility of  – asynchronous Cellular Autotmata: A simulation-based study

dc.contributor.author	Pattanayak, Anupam
dc.contributor.author	Dhal, Subhasish
dc.date.accessioned	2022-05-10T10:03:28Z
dc.date.available	2022-05-10T10:03:28Z
dc.date.issued	2019-01
dc.identifier.uri	http://111.93.204.14:8080/xmlui/handle/123456789/611
dc.description.abstract	Cellular 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.iso	en	en_US
dc.publisher	Conference on Advancement in Computation, Communication and Electronics Paradigm (ACCEP -2019)	en_US
dc.subject	Cellular automata	en_US
dc.subject	Asynchronous cellular automata	en_US
dc.subject	Reversibility	en_US
dc.title	Reversibility of  – asynchronous Cellular Autotmata: A simulation-based study	en_US
dc.type	Article	en_US