Isomorphic Classification of First Degree Cellular Automata

Matrix algebraic formulae concerning some exceptional rules of two-dimensional cellular automata

Characterization of two-dimensional cellular automata over ternary fields

Feature Extraction is a long active topic in image processing, and it attracts lots of attention over the last five decades due to its uses in real-life applications. Edge detection method allows users to discover the features of an image for a notable change in the gray level. This texture indicates an ending of one region and the beginning of another in the image. Likewise, over the last few decades, researchers have been exploring to exploit the simple computing model of Cellular Automata (CA) with local neighborhood structure in image processing techniques. The usage of CA in applications of medical image-processing is identified by Kendall Preston [1] in 1979. It is found that edge detection using CA has a potential advantage over traditional approaches for its lightweight nature and computational efficiency. This paper introduces a new technique for image edge detection using two-dimensional CA. The method can use specific rule sets of CA using the Von Neumann neighborhood for edge detection with null boundary conditions. The performance analysis of the scheme is done and compared with some existing standard edge detection techniques. The results obtained from the proposed technique is very promising for feature extraction.

In this paper, we study 2-dimensional nite cellular automata dened by hexagonal local rule with periodic boundary over the eld Z3.We construct the rule matrix corresponding to the hexagonal cellular automata.For some given coecients and the number of columns of hexagonal information matrix, we prove that the hexagonal cellular automata are reversible.

Image scrambling is the process of converting an image to an unintelligible format, mainly for security reasons. The scrambling is considered as a pre-process or a post-process of security related applications such as watermarking, information hiding, fingerprinting, and encryption. Cellular automata are parallel models of computation that prove an interesting concept where a simple configuration can lead to a complex behavior. Since there are a lot of parameters to configure, cellular automata have many types and these types differ in terms of complexity and behavior. Cellular automata were previously used in scrambling different types of multimedia, but only complex two-dimensional automata were explored. We propose a scheme where the simplest type of cellular automata is used that is the elementary type. We test the scrambling degree for different cellular automata rules that belong to classes three and four of Wolfram's classification which correspond to complex and chaotic behavior; we also check the effect of other parameters such as the number of generations and the boundary condition. Experimental results show that our proposed scheme outperforms other schemes based on cellular automata in terms of scrambling degree.

Cellular Automata (CA) have a long history being employed as pseudo-random number generators (PRNG), especially for cryptographic applications such as keystream generation in stream ciphers. Initially starting from the study of rule 30 of elementary CA, multiple rules where the objects of investigation and were shown to be able to pass most of the rigorous statistical tests used to assess the quality of PRNG. In all cases, the CA employed where of the classical, synchronous kind. This assumes a global clock regulating all CA updates which can be a weakness if an attacker is able to tamper it. Here we study how much asynchrony is necessary to make a CA-based PRNG ineffective. We have found that elementary CA are subdivided into three class: (1) there is a “state transition” where, after a certain level of asynchrony, the CA loses the ability to generate strong random sequences, (2) the randomness of the sequences increases with a limited level of asynchrony, or (3) CA normally unable to be used as PRNG exhibit a much stronger ability to generate random sequences when asynchrony is introduced.

The cellular automaton (CA), a discrete model, is gaining popularity in simulations and scientific exploration across various domains, including cryptography, error-correcting codes, VLSI design and test pattern generation. This paper examines a two-state three-neighborhood nonuniform finite CA with a specified number of fixed points. We utilize a graph-based tool known as the next state rule minterm transition diagram (NSRTD) to analyze the spatiotemporal behavior of these cellular automata (CAs) across all lengths. We devise methods for synthesizing nonuniform single length cycle multi-attractor CAs (MACAs), a specialized class of irreversible CA with a predefined number of fixed points for any arbitrary length. Despite the method’s exponential worst-case time complexity, it offers the advantage of selecting rules for each CA cell from a set of candidate rules, ensuring the desired number of fixed points.

Random Boolean networks (RBN) and Cellular Automata (CA) operate in a very similar way. They update their state with simple deterministic functions called Boolean function or Transition Table (TT), both being essentially the same mechanism under different names. This paper applies a concept most known from CA called Minimum Equivalence (ME). ME is applied to RBN and shows how to calculate the number of unique computations for a given number of neighbours. Crucially, it is shown how RBN rules are even more equivalent than in CA, how the set can be reduced into even fewer unique rules, and how the concept becomes more relevant with larger neighbourhoods. For example, switching transformation alone reduces the number of unique rules in RBN with 4 neighbours from 65 536 to only 3 984 (6.1%) rules. Additionally, this paper examines the ME and transformations in substrates beyond Elementary CA (ECA), such as CA with additional spatial dimensions and number of states.

We propose a method of constructing differential equations directly from cellular automata. Any elementary cellular automata (ECAs) introduced by Wolfram can be transformed into a partial differential equation (PDE) which preserves the time evolution patterns of the ECAs. In particular, some PDEs constructed by the method reproduce complex fractal and self-organizing patterns found in their corresponding ECAs. It is expected that the method can be extended for general cellular automata with more complex rules and/or in higher dimensions.

Evolution-in-Materio (EIM) is a method of using artificial evolution to exploit physical properties of materials for computation. It has previously been successfully used to evolve a multitude of different computational devices implemented in physical materials. One of the main problems has been the stability of solutions due to physical changes in the substrate materials, e.g. topological or electrical, leading to devices sensitive to the evolutionary history, i.e. instability. This paper presents stable linearly and non-linearly separable logic gates, and elementary cellular automata (CA) transition functions, successfully evolved in single-walled carbon nanotube (SWCNT) and polymer composite materials. The results herein show the feasibility of building stand-alone in-materio devices and outline a novel computational abstraction for EIM based on CA. This work is done within the European Project NASCENCE.

Cellular automaton model within the fundamental-diagram approach reproducing some findings of the three-phase theory

In this article, a new cellular automaton traffic flow model, in which randomisation effect is enhanced with the decrease of time gap and the long time stopped vehicle has large randomisation probability, is presented. Both periodic and open boundary conditions are considered. Under periodic boundary condition, the fundamental diagram and the properties of synchronised flow are studied in detail. Under open boundary condition, different congested patterns induced by an on-ramp are analysed. The results are consistent with the well-known results of Kerner's three-phase traffic theory published before.

The aim of this work is to completely solve the reversibility problem for symmetric linear cellular automata with radius r = 3 and null boundary conditions. The main result obtained is the explicit computation of the local transition functions of the inverse cellular automata. This allows introduction of possible and interesting applications in digital image encryption.

Three-state von Neumann cellular automata and pattern generation

Elementary cellular automata (ECA) rule 184 can be used as mathematical models of traffic flows. The slow-to-start model is obtained from the ECA rule 184 model by taking time lag for restart into consideration and is represented by 3-state 3-neighbor cellular automata (CA). In the present paper, we propose a traffic model where vehicles following the slow-to-start rule and those not following the slow-to-start rule are mixed. This model, called the mixed slow-to-start model, is represented by 4-state 3-neighbor CA. Further, we introduce the vector representation of CA with the slow-to-start rule and with the mixed slow-to-start rule, and then get their corresponding fuzzy CA. These fuzzy CA provide continuous-valued traffic models with the slow-to-start effect. Comparing the fundamental diagrams of the the slow-to-start model, the mixed slow-to-start model, and their fuzzy counterparts, we investigate the influence of the density and the mixing ratio of vehicles on traffic jams.