Yayınlanmış 1 Ocak 2012
| Sürüm v1
Dergi makalesi
Açık
ON 1D REVERSIBLE CELLULAR AUTOMATA WITH REFLECTIVE BOUNDARY OVER THE PRIME FIELD OF ORDER p
Oluşturanlar
- 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
Açıklama
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.
Dosyalar
bib-b55a4d2c-1a98-4294-9c39-73e259360f29.txt
Dosyalar
(179 Bytes)
| Ad | Boyut | Hepisini indir |
|---|---|---|
|
md5:7dc81953b45814f4e646e2c8a6c0edd7
|
179 Bytes | Ön İzleme İndir |