Published January 1, 2012
| Version v1
Journal article
Open
ON 1D REVERSIBLE CELLULAR AUTOMATA WITH REFLECTIVE BOUNDARY OVER THE PRIME FIELD OF ORDER p
Creators
- 1. Zirve Univ, Fac Educ, TR-27260 Gaziantep, Turkey
- 2. Yildiz Tech Univ, Fac Chem & Met Engn, Dept Engn Math, TR-34210 Istanbul, Turkey
- 3. Yildiz Tech Univ, Arts & Sci Fac, Dept Math, TR-34210 Istanbul, Turkey
Description
In 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.
Files
bib-b55a4d2c-1a98-4294-9c39-73e259360f29.txt
Files
(179 Bytes)
| Name | Size | Download all |
|---|---|---|
|
md5:7dc81953b45814f4e646e2c8a6c0edd7
|
179 Bytes | Preview Download |