𝔖 Bobbio Scriptorium
✦   LIBER   ✦

General algorithm for two-dimensional totalistic cellular automata

✍ Scribed by Franco Bagnoli; Raúl Rechtman; Stefano Ruffo

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
840 KB
Volume
101
Category
Article
ISSN
0021-9991

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algorithms for Leader Election by Cellul
Algorithms for Leader Election by Cellular Automata
✍ Codrin Nichitiu; Jacques Mazoyer; Eric Rémila 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 224 KB

We present two cellular algorithms, in O n and respectively in O w 2 , for the leader election problem on finite connected rings F and respectively finite connected subsets of d , of eccentricity w, for any fixed d. The problem consists of finding an algorithm such that when setting the elements of

Automaticity of double sequences generat
Automaticity of double sequences generated by one-dimensional linear cellular automata
✍ J.-P Allouche; F von Haeseler; H.-O Peitgen; A Petersen; G Skordev 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 991 KB

We give a complete answer to the question whether a double sequence that is generated by a one-dimensional linear cellular automaton, and whose states are integers modulo m, is k-automatic or not.