Special Issue
Cellular Automata in Theoretical Computer Science
Guest Editors
Georgios Ch. Sirakoulis and Jarosław Wąs
p. 1-5
Editorial Note on Cellular Automata in Theoretical Computer Science
Georgios Ch. Sirakoulis and Jarosław Wąs
Abstract
Full Text (IP)
p. 7-26
Iterative Arrays with Set Storage
Martin Kutrib and Andreas Malcher
Abstract
Full Text (IP)
p. 27-45
Propositional Logic and Cellular Automata on Monoids
Toshikazu Ishida, Shuichi Inokuchi and Yasuo Kawahara
Abstract
Full Text (IP)
p. 47-61
1/f Noise in the Computation Process by Rule 110
Shigeru Ninagawa and Genaro J. Martínez
Abstract
Full Text (IP)
p. 63-80
On the Dynamics of Stochastic Elementary Cellular Automata
Jan M. Baetens, Wouter Van Der Meeren and Bernard De Baets
Abstract
Full Text (IP)
p. 81-100
On Synthesis of Non-Uniform Cellular Automata Having Only Point Attractors
Sumit Adak, Nazma Naskar, Pradipta Maji and Sukanta Das
Abstract
Full Text (IP)
p. 101-120
Direction-Reversible Self-Timed Cellular Automata for Delay-Insensitive Circuits
Daniel Morrison and Irek Ulidowski
Abstract
Full Text (IP)
p. 121-139
Finitization of Infinite Field-based Multi-general FSSP Solution
Luidnel Maignan and Jean-Baptiste Yunès
Abstract
Full Text (IP)
p. 141-157
Prevention of Fault Attacks in Cellular Automata Based Stream Ciphers
Jimmy Jose, Sourav Das and Dipanwita Roy Chowdhury
Abstract
Full Text (IP)