Yayın:
Transient and Cycle Structure of Elementary Rule 150 with Reflective Boundary

Basit öğe sayfası
dc.contributor.authorAkin, Hasan
dc.contributor.authorSiap, Irfan
dc.contributor.authorKoroglu, Mehmet E.
dc.contributor.institutionauthorKÖROĞLU, Mehmet Emin
dc.date.accessioned2026-06-27T13:17:03Z
dc.date.issued2012
dc.description.abstractCellular automata are simple mathematical representation of complex dynamical systems. Therefore there are several applications of cellular automata in many areas such as coding, cryptography, VLSI design etc. [1, 2]. In this study, a recurrence relation for computation minimal polynomial of rule matrix of linear elementary rule 150 with reflective boundary condition is obtained. Then, the maximum transient and cycle lengths of this rule are calculated by algorithm in [3].en
dc.description.sponsorshipScientific and Technological Research Council of Turkey (TUBITAK) [110T713]
dc.description.urihttps://doi.org/10.1063/1.4747663
dc.identifier.doi10.1063/1.4747663
dc.identifier.endpage158
dc.identifier.isbn978-0-7354-1077-0
dc.identifier.issn0094-243X
dc.identifier.startpage156
dc.identifier.urihttps://hdl.handle.net/20.500.14981/51447
dc.identifier.volume1470
dc.identifier.wos000309524400039
dc.language.isoeng
dc.publisherAMER INST PHYSICS
dc.relation.conference1st International Conference on Analysis and Applied Mathematics (ICAAM)
dc.relation.ispartofFIRST INTERNATIONAL CONFERENCE ON ANALYSIS AND APPLIED MATHEMATICS (ICAAM 2012)
dc.subjectCellular automata
dc.subjectReflective boundary
dc.subjectTransient and cycle lengths
dc.subjectCELLULAR-AUTOMATA
dc.subjectMathematics
dc.subjectPhysics
dc.titleTransient and Cycle Structure of Elementary Rule 150 with Reflective Boundary
dc.typeProceedings Paper
dspace.entity.typePublication
local.import.sourceWOS

Dosyalar

Koleksiyonlar

Yayınlar