This paper is concerned with the topological entropy of invertible one-dimensional linear cellular automata, i.e., the maps T f [-r,r] : m and f : Z 2r+1 m → Z m , over the ring Z m (m 2) by means of algorithm defined by D'amica et al. [On computing the entropy of cellular automa, Theoret. Comput.
✦ LIBER ✦
On the invertible cellular automata 150 over
✍ Scribed by Martín del Rey, Ángel; Rodríguez Sánchez, Gerardo
- Book ID
- 123059322
- Publisher
- Elsevier Science
- Year
- 2013
- Tongue
- English
- Weight
- 170 KB
- Volume
- 219
- Category
- Article
- ISSN
- 0096-3003
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
The topological entropy of invertible ce
✍
Hasan Akın
📂
Article
📅
2008
🏛
Elsevier Science
🌐
English
⚖ 159 KB
On cellular automata over Galois rings
✍
Hasan Akın; Irfan Siap
📂
Article
📅
2007
🏛
Elsevier Science
🌐
English
⚖ 125 KB
New Synthesis of One-Dimensional 90/150
✍
Sung-Jin Cho; Un-Sook Choi; Han-Doo Kim; Yoon-Hee Hwang; Jin-Gyoung Kim; Seong-H
📂
Article
📅
2007
🏛
IEEE
🌐
English
⚖ 146 KB
On the classifiability of cellular autom
✍
John T. Baldwin; Saharon Shelah
📂
Article
📅
2000
🏛
Elsevier Science
🌐
English
⚖ 106 KB
Based on computer simulations Wolfram presented in several papers conjectured classiÿcations of cellular automata into four types. We show a natural formalization of his rate of growth suggestion does not provide a classiÿcation (even probabilistically) of all cellular automata: For any rational p;
On the ergodic theory of cellular automa
✍
Stephen J. Willson
📂
Article
📅
1975
🏛
Springer
🌐
English
⚖ 585 KB
On the behavior characteristics of cellu
✍
Chen Jin-cai; Zhang Jiang-ling; Feng Dan
📂
Article
📅
2005
🏛
Wuhan University
🌐
English
⚖ 548 KB