2D Linear CA with Mixing Boundary Conditions and Reversibility

被引：1

作者：

Jumaniyozov, Doston ^{[1
]}

Manuel Casas, Jose ^{[2
,3
]}

Ladra Gonzalez, Manuel ^{[4
,5
]}

Omirov, Bakhrom ^{[6
,7
]}

Redjepov, Shovkat ^{[8
,9
]}

机构：

[1] Uzbek Acad Sci, Inst Math, Univ St, Tashkent 100174, Uzbekistan

[2] Univ Vigo, Pontevedra 36005, Spain

[3] EE Forestal, CITMAga, Pontevedra 36005, Spain

[4] Univ Santiago de Compostela, Praza Obradoiro, Santiago De Compostela 15705, Spain

[5] CITMAga, Santiago De Compostela 15782, Spain

[6] Harbin Inst Technol, Inst Adv Study Math, Harbin 150001, Peoples R China

[7] New Uzbekistan Univ, 54 Mustaqillik Ave, Tashkent 100007, Uzbekistan

[8] Tashkent Univ Informat Technol, Amir Temur St, Tashkent 100200, Uzbekistan

[9] Inst Fundamental & Appl Res, 39 Kari Niyazov St, Tashkent 100000, Uzbekistan

来源：

INTERNATIONAL JOURNAL OF BIFURCATION AND CHAOS | 2023年 / 33卷 / 08期

关键词：

Cellular automata; rule matrix; Garden of Eden; CELLULAR-AUTOMATA;

D O I：

10.1142/S0218127423500943

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

In this paper, we consider two-dimensional cellular automata (CA) with the von Neumann neighborhood. We study the characterization of 2D linear cellular automata defined by the von Neumann neighborhood with new type of boundary conditions over the field Z(p.) Furthermore, we investigate the rule matrices of 2D von Neumann CA by applying the group of permutations S4. Moreover, the algorithm for computing the rank of rule matrices is given. Finally, necessary and sufficient conditions for the existence of Garden of Eden configurations for considered two-dimensional cellular automata are obtained.

引用

页数：19

共 18 条

[1] Nonconstructible blocks in 1D cellular automata: minimal generators and natural systems [J].

Adamatzky, A .

APPLIED MATHEMATICS AND COMPUTATION, 1999, 99 (01) :77-91

[2]

[Anonymous], 1963, PROC S APPL MATH

[3]

Coombs S., 2009, GEOMETRY PIGMENTATIO

[4]

Das A. K., 1990, THESIS IIT KHARAGPUR

[5] Matrix algebraic formulae concerning some exceptional rules of two-dimensional cellular automata [J].

Dihidar, K ;

Choudhury, PP .

INFORMATION SCIENCES, 2004, 165 (1-2) :91-101

[6] INVERSION OF 2D CELLULAR-AUTOMATA - SOME COMPLEXITY RESULTS [J].

DURAND, B .

THEORETICAL COMPUTER SCIENCE, 1994, 134 (02) :387-401

[7] CRIPTOCEL: Design of cellular automata based cipher schemes [J].

Franti, E ;

Goschin, S ;

Dascalu, M ;

Catrina, N ;

Dobrin, M .

2004 INTERNATIONAL CONFERENCE ON COMMUNICATION, CIRCUITS, AND SYSTEMS, VOLS 1 AND 2: VOL 1: COMMUNICATION THEORY AND SYSTEMS, 2004, :1103-1107

[8]

Inokuchi S., 2000, Bulletin of Informatics and Cybernetics, V32, P23

[9]

Jumaniyozov D. E., 2022, IRREVERSIBILITY 2D L

[10] REVERSIBILITY OF 2D CELLULAR AUTOMATA IS UNDECIDABLE [J].

KARI, J .

PHYSICA D, 1990, 45 (1-3) :379-385

← 1 2 →