Yayın:
ON 1D REVERSIBLE CELLULAR AUTOMATA WITH REFLECTIVE BOUNDARY OVER THE PRIME FIELD OF ORDER p

Basit öğe sayfası
dc.contributor.authorAkin, Hasan
dc.contributor.authorSah, Ferhat
dc.contributor.authorSiap, Irfan
dc.date.accessioned2026-06-27T13:17:44Z
dc.date.issued2012
dc.description.abstractIn this paper, we study one dimensional finite linear cellular automata with reflective boundary condition by using matrix algebra built on the field Z(p). We present an algorithm for determining the reversibility of this family of cellular automata. We also answer the reversibility question for some special subfamilies. Finally, we present some examples of this family of cellular automata under the reflective boundary condition.en
dc.description.sponsorshipScientific and Technological Research Council of Turkey (TUBITAK) [110T713]
dc.description.urihttps://doi.org/10.1142/s0129183111017020
dc.identifier.doi10.1142/s0129183111017020
dc.identifier.issn0129-1831
dc.identifier.issue1
dc.identifier.urihttps://hdl.handle.net/20.500.14981/51586
dc.identifier.volume23
dc.identifier.wos000300548200004
dc.language.isoeng
dc.publisherWORLD SCIENTIFIC PUBL CO PTE LTD
dc.relation.ispartofINTERNATIONAL JOURNAL OF MODERN PHYSICS C
dc.subjectCellular automata
dc.subjectreflective boundary condition
dc.subjectmatrix representations
dc.subjectreversibility
dc.subjectTRIDIAGONAL MATRICES
dc.subjectPERIODIC BOUNDARY
dc.subjectINVERSE
dc.subjectComputer Science
dc.subjectPhysics
dc.titleON 1D REVERSIBLE CELLULAR AUTOMATA WITH REFLECTIVE BOUNDARY OVER THE PRIME FIELD OF ORDER p
dc.typeArticle
dspace.entity.typePublication
local.import.sourceWOS

Dosyalar

Koleksiyonlar

Yayınlar