Search

Cellular automata (CA) theory is a very rich and useful model of a discrete dynamical system that focuses on their local information relying on the neighboring cells to produce CA global behaviors. Although the main structure of CA is a discrete special model, the global behaviors at many iterative times and on big scales can be close to nearly a continuous system. The mathematical points of the basic model imply the computable values of the mathematical structure of CA. After modeling the CA structure, an important problem is to be able to move forwards and backwards on CA to understand their behaviors in more elegant ways. This happens in the possible case if CA is a reversible one. In this paper, we investigate the structure and the reversibility cases of two-dimensional (2D) finite, linear, and triangular von Neumann CA with periodic boundary case. It is considered on ternary field ℤ 3 (i.e. 3-state). We obtain the transition rule matrices for each special case. It is known that the reversibility cases of 2D CA is generally a very challenging problem. For given special triangular information (transition) rule matrices, we prove which triangular linear 2D von Neumann CA is reversible or not. In other words, the reversibility problem of 2D triangular, linear von Neumann CA with periodic boundary is resolved completely over ternary field. However, the general transition rule matrices are also presented to establish the reversibility cases of these special 3-states CA. Since the main CA structures are sufficiently simple to investigate in mathematical ways and also very complex for obtaining chaotic models, we believe that these new types of CA can be found in many different real life applications in special cases e.g. mathematical modeling, theoretical biology and chemistry, DNA research, image science, textile design, etc. in the near future. [ABSTRACT FROM AUTHOR]

Even though the fundamental main structure of cellular automata (CA) is a discrete special model, the global behaviors at many iterative times and on big scales could be a close, nearly a continuous, model system. CA theory is a very rich and useful phenomena of dynamical model that focuses on the local information being relayed to the neighboring cells to produce CA global behaviors. The mathematical points of the basic model imply the computable values of the mathematical structure of CA. After modeling the CA structure, an important problem is to be able to move forwards and backwards on CA to understand their behaviors in more elegant ways. A possible case is when CA is to be a reversible one. In this paper, we investigate the structure and the reversibility of two-dimensional (2D) finite, linear, triangular von Neumann CA with null boundary case. It is considered on ternary field (i.e. 3-state). We obtain their transition rule matrices for each special case. For given special triangular information (transition) rule matrices, we prove which triangular linear 2D von Neumann CAs are reversible or not. It is known that the reversibility cases of 2D CA are generally a much challenged problem. In the present study, the reversibility problem of 2D triangular, linear von Neumann CA with null boundary is resolved completely over ternary field. As far as we know, there is no structure and reversibility study of von Neumann 2D linear CA on triangular lattice in the literature. Due to the main CA structures being sufficiently simple to investigate in mathematical ways, and also very complex to obtain in chaotic systems, it is believed that the present construction can be applied to many areas related to these CA using any other transition rules. [ABSTRACT FROM AUTHOR]

This paper presents a study of two-dimensional hexagonal cellular automata (CA) with periodic boundary. Although the basic construction of a cellular automaton is a discrete model, its global level behavior at large times and on large spatial scales can be a close approximation to a continuous system. Meanwhile CA is a model of dynamical phenomena that focuses on the local behavior which depends on the neighboring cells in order to express their global behavior. The mathematical structure of the model suggests the importance of the algebraic structure of cellular automata. After modeling the dynamical behaviors, it is sometimes an important problem to be able to move backwards on CAs in order to understand the behaviors better. This is only possible if cellular automaton is a reversible one. In the present paper, we study two-dimensional finite CA defined by hexagonal local rule with periodic boundary over the field ℤ3 (i.e. 3-state). We construct the rule matrix corresponding to the hexagonal periodic cellular automata. For some given coefficients and the number of columns of hexagonal information matrix, we prove that the hexagonal periodic cellular automata are reversible. Moreover, we present general algorithms to determine the reversibility of 2D 3-state cellular automata with periodic boundary. A well known fact is that the determination of the reversibility of a two-dimensional CA is a very difficult problem, in general. In this study, the reversibility problem of two-dimensional hexagonal periodic CA is resolved completely. Since CA are sufficiently simple to allow detailed mathematical analysis, also sufficiently complex to produce chaos in dynamical systems, we believe that our construction will be applied many areas related to these CA using any other transition rules. [ABSTRACT FROM AUTHOR]