Journal ArticleDOI
Statistical mechanics of cellular automata
Reads0
Chats0
TLDR
Analysis is given of ''elementary'' cellular automata consisting of a sequence of sites with values 0 or 1 on a line, with each site evolving deterministically in discrete time steps according to p definite rules involving the values of its nearest neighbors.Abstract:
Cellular automata are used as simple mathematical models to investigate self-organization in statistical mechanics. A detailed analysis is given of "elementary" cellular automata consisting of a sequence of sites with values 0 or 1 on a line, with each site evolving deterministically in discrete time steps according to definite rules involving the values of its nearest neighbors. With simple initial configurations, the cellular automata either tend to homogeneous states, or generate self-similar patterns with fractal dimensions \ensuremath{\simeq} 1.59 or \ensuremath{\simeq} 1.69. With "random" initial configurations, the irreversible character of the cellular automaton evolution leads to several self-organization phenomena. Statistical properties of the structures generated are found to lie in two universality classes, independent of the details of the initial state or the cellular automaton rules. More complicated cellular automata are briefly considered, and connections with dynamical systems theory and the formal theory of computation are discussed.read more
Citations
More filters
Posted Content
On-Chip Electric Waves: An Analog Circuit Approach to Physical Uncloneable Functions
György Csaba,Xueming Ju,Qingqing Chen,Wolfgang Porod,Jürgen Schmidhuber,Ulf Schlichtmann,Paolo Lugli,Ulrich Rührmair +7 more
TL;DR: It is argued that analog circuits with higher security than existing digital PUFs are needed and that the CNN paradigm allows us to build large, unclonable, and scalable analog PUFs, which still show a stable and repeatable input output behavior.
Book ChapterDOI
A near optimal S-box design
TL;DR: Though the proposed S-box is not optimal to the linear and differential attacks like Rijndael S- box, its immunity towards linear cryptanalysis and robustness against differential cryptanalysis is high and it lacks algebraic relations over finite field.
Journal ArticleDOI
Discrete Integrable Equations over Finite Fields
TL;DR: In this paper, a generalized discrete KdV equation related to a Yang{Baxter map is investigated and the indeter-minacy of the equation is resolved by treating it over a field of rational functions instead of the finite field itself.
Proceedings ArticleDOI
Image encryption method based on Elementary Cellular Automata
TL;DR: Simulation results on some gray level images show that the proposed image encryption method satisfies the properties of confusion and diffusion, and has perfect information concealing and a large number of secret key.
Proceedings ArticleDOI
Uniform Cellular Automata Linear Rules for Edge Detection
TL;DR: An efficient and simple method of edge detection based on uniform cellular automata transition matrix representation is proposed and some results of the proposed linear rules for edge detection are presented and compared with some classical results.
References
More filters
Book
Introduction to Automata Theory, Languages, and Computation
TL;DR: This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity, appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments.
Journal ArticleDOI
The Chemical Basis of Morphogenesis
TL;DR: In this article, it is suggested that a system of chemical substances, called morphogens, reacting together and diffusing through a tissue, is adequate to account for the main phenomena of morphogenesis.
Journal ArticleDOI
On Computable Numbers, with an Application to the Entscheidungsproblem
TL;DR: This chapter discusses the application of the diagonal process of the universal computing machine, which automates the calculation of circle and circle-free numbers.
Journal ArticleDOI
Metabolic stability and epigenesis in randomly constructed genetic nets
TL;DR: The hypothesis that contemporary organisms are also randomly constructed molecular automata is examined by modeling the gene as a binary (on-off) device and studying the behavior of large, randomly constructed nets of these binary “genes”.
Journal ArticleDOI
Diffusion-limited aggregation, a kinetic critical phenomenon
Abstract: A model for random aggregates is studied by computer simulation The model is applicable to a metal-particle aggregation process whose correlations have been measured previously Density correlations within the model aggregates fall off with distance with a fractional power law, like those of the metal aggregates The radius of gyration of the model aggregates has power-law behavior The model is a limit of a model of dendritic growth