ON 1D REVERSIBLE CELLULAR AUTOMATA WITH REFLECTIVE BOUNDARY OVER THE PRIME FIELD OF ORDER p-Reference-Cited by-同舟云学术

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

Published:2012-01 Issue:01 Volume:23 Page:1250004
ISSN:0129-1831
Container-title:International Journal of Modern Physics C
language:en
Short-container-title:Int. J. Mod. Phys. C

Author:

AKIN HASAN¹,SAH FERHAT²,SIAP IRFAN³

Affiliation:

1. Faculty of Education, Zirve University, 27260, Gaziantep, Turkey

2. Department of Engineering Mathematics, Faculty of Chemical and Metallurgical Engineering, Yildiz Technical University, Davutpasa Campus, 34210 Esenler, Istanbul, Turkey

3. Department of Mathematics, Arts and Science Faculty, Yildiz Technical University, Davutpasa Campus, 34210 Esenler, Istanbul, Turkey

Abstract

In this paper, we study one dimensional finite linear cellular automata with reflective boundary condition by using matrix algebra built on the field ℤ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.

Publisher

World Scientific Pub Co Pte Lt

Subject

Computational Theory and Mathematics,Computer Science Applications,General Physics and Astronomy,Mathematical Physics,Statistical and Nonlinear Physics

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0129183111017020

Reference20 articles.

1. Statistical mechanics of cellular automata

2. A multisecret sharing scheme for color images based on cellular automata

3. Comments on "Theory and applications of cellular automata in cryptography" [with reply]

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Decision algorithms for reversibility of 1D cellular automata under reflective boundary conditions;Theoretical Computer Science;2024-10

2. Application and Reversibility of Three Dimensional Cellular Automata;Muş Alparslan Üniversitesi Fen Bilimleri Dergisi;2024-07-01

3. Reversibility of linear cellular automata with intermediate boundary condition;AIMS Mathematics;2024

4. Efficient methods with polynomial complexity to determine the reversibility of general 1D linear cellular automata over Zp;Information Sciences;2022-05

5. The Entropy and Reversibility of Cellular Automata on Cayley Tree;International Journal of Bifurcation and Chaos;2020-03-30