Yayın:
Garden of eden configurations for 2-D cellular automata with rule 2460 N

Basit öğe sayfası
dc.contributor.authorSiap, Irfan
dc.contributor.authorAkin, Hasan
dc.contributor.authorSah, Ferhat
dc.date.accessioned2026-06-27T12:52:02Z
dc.date.issued2010
dc.description.abstractAn important problem in cellular automata theory is the reversibility of a cellular automaton which is related to the existence of Garden of Eden configurations in cellular automata. In this paper, we study new local rules for two-dimensional cellular automata over the ternary field Z(3) (the set of integers modulo three) with some of their important characteristics. We obtain necessary and sufficient conditions for the existence of Garden of Eden configurations for two-dimensional ternary cellular automata. Also by making use of the matrix representation of two-dimensional cellular automata, we provide an algorithm to obtain the number of Garden of Eden configurations for two-dimensional cellular automata defined by rule 2460 N. We present an application of the reversible two-dimensional ternary cellular automata to cryptography. (C) 2010 Elsevier Inc. All rights reserved.en
dc.description.urihttps://doi.org/10.1016/j.ins.2010.05.039
dc.identifier.doi10.1016/j.ins.2010.05.039
dc.identifier.eissn1872-6291
dc.identifier.endpage3571
dc.identifier.issn0020-0255
dc.identifier.issue18
dc.identifier.startpage3562
dc.identifier.urihttps://hdl.handle.net/20.500.14981/47626
dc.identifier.volume180
dc.identifier.wos000280380500012
dc.language.isoeng
dc.publisherELSEVIER SCIENCE INC
dc.relation.ispartofINFORMATION SCIENCES
dc.subjectCellular automata
dc.subjectGarden of Eden
dc.subjectMatrix algebra
dc.subjectComputer Science
dc.titleGarden of eden configurations for 2-D cellular automata with rule 2460 N
dc.typeArticle
dspace.entity.typePublication
local.import.sourceWOS

Dosyalar

Koleksiyonlar

Yayınlar