Log in

Relevant bibliographies by topics / Cellullar automata / Journal articles

To see the other types of publications on this topic, follow the link: Cellullar automata.

Journal articles on the topic 'Cellullar automata'

Author: Grafiati

Published: 19 February 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Cellullar automata.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Melati, Dian Nuraini. "Multi Temporal Remotely Sensed Image Modelling For Deforestation Monitoring." Jurnal Alami : Jurnal Teknologi Reduksi Risiko Bencana 3, no. 1 (May 31, 2019): 43. http://dx.doi.org/10.29122/alami.v3i1.3368.

Full text

Abstract:

Tropical rainforest in Indonesia faces critical issue related to deforestation. Human activities which convert forest cover into non-forest cover has been a major issue. In order to sustain the forest resources, monitoring on deforestation and forest cover prediction is necessary to be done. Remotely sensed data, Landsat images, with acquisition in 1996, 2000, and 2005 are used in this study. In this study area, forest cover decreased around 6 % in the period of 1996 - 2005. For the purpose of forest cover modelling, three model (i.e. Stochastic Markov Model, Cellullar Automata Markov (CA_Markov) Model, dan GEOMOD) were tested. Based upon the Kappa index, GEOMOD performed better with the highest Kappa index. Therefore, GEOMOD is recommended to forecast forest cover.

APA, Harvard, Vancouver, ISO, and other styles

2

Jung, Goeun, and Youngho Kim. "Modeling of Spatio-temporal changes of Urban Sprawl in Jeju-island: Using CA (Cellular Automata) and ARD (Automatic Rule Detection)." Journal of the Association of Korean Geographers 10, no. 1 (April 30, 2021): 139–52. http://dx.doi.org/10.25202/jakg.10.1.9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

TORBEY, SAMI. "TOWARDS A FRAMEWORK FOR INTUITIVE PROGRAMMING OF CELLULAR AUTOMATA." Parallel Processing Letters 19, no. 01 (March 2009): 73–83. http://dx.doi.org/10.1142/s0129626409000079.

Full text

Abstract:

The ability to obtain complex global behaviour from simple local rules makes cellular automata an interesting platform for massively parallel computation. However, manually designing a cellular automaton to perform a given computation can be extremely difficult, and automated design techniques such as genetic programming have their limitations because of the absence of human intuition. In this paper, we propose elements of a framework whose goal is to make the manual synthesis of cellular automata rules exhibiting desired global characteristics more programmer-friendly, while maintaining the simplicity of local processing elements. Although many of the framework elements that we describe here are not new, we group them into a consistent framework and show that they can all be implemented on a traditional cellular automaton, which means that they are merely more human-friendly ways of describing simple cellular automata rules, and not foreign structures that require changing the traditional cellular automaton model.

APA, Harvard, Vancouver, ISO, and other styles

4

Rowland, Eric, and Reem Yassawi. "Automaticity and Invariant Measures of Linear Cellular Automata." Canadian Journal of Mathematics 72, no. 6 (September 5, 2019): 1691–726. http://dx.doi.org/10.4153/s0008414x19000488.

Full text

Abstract:

AbstractWe show that spacetime diagrams of linear cellular automata $\unicode[STIX]{x1D6F7}:\,\mathbb{F}_{p}^{\mathbb{Z}}\rightarrow \mathbb{F}_{p}^{\mathbb{Z}}$ with $(-p)$-automatic initial conditions are automatic. This extends existing results on initial conditions that are eventually constant. Each automatic spacetime diagram defines a $(\unicode[STIX]{x1D70E},\unicode[STIX]{x1D6F7})$-invariant subset of $\mathbb{F}_{p}^{\mathbb{Z}}$, where $\unicode[STIX]{x1D70E}$ is the left shift map, and if the initial condition is not eventually periodic, then this invariant set is nontrivial. For the Ledrappier cellular automaton we construct a family of nontrivial $(\unicode[STIX]{x1D70E},\unicode[STIX]{x1D6F7})$-invariant measures on $\mathbb{F}_{3}^{\mathbb{Z}}$. Finally, given a linear cellular automaton $\unicode[STIX]{x1D6F7}$, we construct a nontrivial $(\unicode[STIX]{x1D70E},\unicode[STIX]{x1D6F7})$-invariant measure on $\mathbb{F}_{p}^{\mathbb{Z}}$ for all but finitely many $p$.

APA, Harvard, Vancouver, ISO, and other styles

5

Barragan-Vite, Irving, Juan C. Seck-Tuoh-Mora, Norberto Hernandez-Romero, Joselito Medina-Marin, and Eva S. Hernandez-Gress. "Distributed Control of a Manufacturing System with One-Dimensional Cellular Automata." Complexity 2018 (October 4, 2018): 1–15. http://dx.doi.org/10.1155/2018/7235105.

Full text

Abstract:

We present a distributed control modeling approach for an automated manufacturing system based on the dynamics of one-dimensional cellular automata. This is inspired by the fact that both cellular automata and manufacturing systems are discrete dynamical systems where local interactions given among their elements (resources) can lead to complex dynamics, despite the simple rules governing such interactions. The cellular automaton model developed in this study focuses on two states of the resources of a manufacturing system, namely, busy or idle. However, the interaction among the resources such as whether they are shared at different stages of the manufacturing process determines the global dynamics of the system. A procedure is shown to obtain the local evolution rule of the automaton based on the relationships among the resources and the material flow through the manufacturing process. The resulting distributed control of the manufacturing system appears to be heterarchical, and the evolution of the cellular automaton exhibits a Class II behavior for some given disordered initial conditions.

APA, Harvard, Vancouver, ISO, and other styles

6

BOCCARA, NINO. "RANDOMIZED CELLULAR AUTOMATA." International Journal of Modern Physics C 18, no. 08 (August 2007): 1303–12. http://dx.doi.org/10.1142/s0129183107011339.

Full text

Abstract:

We define and study a few properties of a class of random automata networks. While regular finite one-dimensional cellular automata are defined on periodic lattices, these automata networks, called randomized cellular automata, are defined on random directed graphs with constant out-degrees and evolve according to cellular automaton rules. For some families of rules, a few typical a priori unexpected results are presented.

APA, Harvard, Vancouver, ISO, and other styles

7

Mardiris, Vassilios A., Georgios Ch Sirakoulis, and Ioannis G. Karafyllidis. "Automated Design Architecture for 1-D Cellular Automata Using Quantum Cellular Automata." IEEE Transactions on Computers 64, no. 9 (September 1, 2015): 2476–89. http://dx.doi.org/10.1109/tc.2014.2366745.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Allouche, J. P., F. V. Haeseler, E. Lange, A. Petersen, and G. Skordev. "Linear cellular automata and automatic sequences." Parallel Computing 23, no. 11 (November 1997): 1577–92. http://dx.doi.org/10.1016/s0167-8191(97)00074-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

DUBACQ, JEAN-CHRISTOPHE. "HOW TO SIMULATE TURING MACHINES BY INVERTIBLE ONE-DIMENSIONAL CELLULAR AUTOMATA." International Journal of Foundations of Computer Science 06, no. 04 (December 1995): 395–402. http://dx.doi.org/10.1142/s0129054195000202.

Full text

Abstract:

The issue of testing invertibility of cellular automata has been often discussed. Constructing invertible automata is very useful for simulating invertible dynamical systems, based on local rules. The computation universality of cellular automata has long been positively resolved, and by showing that any cellular automaton could be simulated by an invertible one having a superior dimension, Toffoli proved that invertible cellular automaton of dimension d≥2 were computation-universal. Morita proved that any invertible Turing Machine could be simulated by a one-dimensional invertible cellular automaton, which proved computation-universality of invertible cellular automata. This article shows how to simulate any Turing Machine by an invertible cellular automaton with no loss of time and gives, as a corollary, an easier proof of this result.

APA, Harvard, Vancouver, ISO, and other styles

10

Zhukov, Alexey E. "The reversibility of one-dimensional cellular automata." RUDN Journal of Engineering Researches 22, no. 1 (August 27, 2021): 7–15. http://dx.doi.org/10.22363/2312-8143-2021-22-1-7-15.

Full text

Abstract:

Recently the reversible cellular automata are increasingly used to build high-performance cryptographic algorithms. The paper establishes a connection between the reversibility of homogeneous one-dimensional binary cellular automata of a finite size and the properties of a structure called binary filter with input memory and such finite automata properties as the prohibitions in automata output and loss of information. We show that finding the preimage for an arbitrary configuration of a one-dimensional cellular automaton of length L with a local transition function f is associated with reversibility of a binary filter with input memory. As a fact, the nonlinear filter with an input memory corresponding to our cellular automaton does not depend on the number of memory cells of the cellular automaton. The results obtained make it possible to reduce the complexity of solving massive enumeration problems related to the issues of reversibility of cellular automata. All the results obtained can be transferred to cellular automata with non-binary cell filling and to cellular automata of dimension greater than 1.

APA, Harvard, Vancouver, ISO, and other styles

11

Kozlov, Valery, Alexander Tatashev, and Marina Yashina. "Elementary Cellular Automata as Invariant under Conjugation Transformation or Combination of Conjugation and Reflection Transformations, and Applications to Traffic Modeling." Mathematics 10, no. 19 (September 28, 2022): 3541. http://dx.doi.org/10.3390/math10193541.

Full text

Abstract:

This paper develops the analysis of properties of the cellular automata class introduced by the authors. It is assumed that the set of automaton cells is finite and forms a closed lattice, and there are two states for each automaton cell. We consider a new concept. This concept is the average velocity of a cellular automaton, which characterizes the average intensity of changes in the states of the automaton’s cells for a given initial state. The automaton velocity is equal to 1 if the state of any cell changes at each step. The spectrum of average velocities of a cellular automaton is the set of average velocities for different initial states. Since the state space is finite, the automaton, starting from a certain moment of time, is in periodically repeating states of a cycle, and thus, the research of the velocity spectrum is related to the problem of studying the set of the automaton cycles. For elementary cellular automata, the introduced class consists of a subclass of automata such that the conjugation trasformation of an automaton is the automaton itself (Subclass A) or the reflection of the automaton (Subclass B). For this class, it is proved that the spectrum of the automaton contains the value v0 if and only if the spectrum of the complementary automaton contains the value 1−v0 (the sum of the index of elementary cellular automaton and the complementary automaton is 255). For automata of Subclasses A and B, the set of cycles and the velocity spectrum are studied. For Subclass A, a theorem has been proved such that in accordance with this theorem, if two automata complementary to each other start evolving in the same initial state, then the sum of their average velocities is equal to 1. This theorem for Subclass A is generalized to cellular automata, invariant under the conjugation transformation, of more general type than elementary automata. Generalizations of the theorem have been given for the class of one-dimensional cellular automata with a neighborhood containing 2r+1 cells (the next state of the cell depends on the present states of this cell, r cells on the left and r cells on the right) and for some traditionally considered classes of two-dimensional automata. Some elementary cellular automata belonging to the class considered in the paper can be interpreted as transport models. The properties of the spectra for these automata are studied and compared with the properties of elementary cellular automata not invariant under the considered transformations and can also be interpreted as transport models. The analytical results obtained for these simple models can be used to study the qualitative properties and limiting behavior of more complex transport models.

APA, Harvard, Vancouver, ISO, and other styles

12

Gyöngyösi, Szilvia, Anita Tóth, and Péter Barkóczy. "Simulation of Phase Transformations Driven by Short Range Diffusion by Cellular Automaton." Materials Science Forum 659 (September 2010): 405–10. http://dx.doi.org/10.4028/www.scientific.net/msf.659.405.

Full text

Abstract:

The same property of the phase transformations driven by short range diffusion (recrystallization, allotropic transformation, grain coarsening) is that the movements of the grain or the phase boundaries take place by atomic jumps through the boundaries. The probability (frequency) of these jumps depends on only on the energy state of the closenear neighborhood of the atoms. In the operation of cellular automata Consequently, only the closenear neighborhood of the cells is taken into account in the operation of the cellular automaton. This similarity makes applicable the cellular automaton applicable to simulate the aforementioned phase transformation processes. A condition (rule) of the movement of grain and phase boundaries is introduced, which makes it possible to simulate all the all mentioned phase transformation by the same automatona.

APA, Harvard, Vancouver, ISO, and other styles

13

Alexander P, Buslaev, Tatashev Alexander G, and Yashina Marina V. "On cellular automata, traffic and dynamical systems in graphs." International Journal of Engineering & Technology 7, no. 2.28 (May 16, 2018): 351. http://dx.doi.org/10.14419/ijet.v7i2.28.13210.

Full text

Abstract:

Qualitative studies of discrete dynamical systems behavior on networks are relevant in many fields such as system biology, transportation, information traffic, material sciences and so on. We consider cellular automata on one-dimensional and two-dimensional toroidal supporters. At every discrete time moment, each cell of a cellular automaton is in one of two states 0 and 1. We introduce concept of the cellular automaton mass at fixed time. The cellular automaton mass is the quantity of cells such that these cells are in the state 1. The mass conservation law takes place if the mass of cellular automaton is the same at every time. Concepts of explosion and annihilation have been introduced. Explosion takes place if the mass of cellular automaton increases at each iteration until all cells are in the state 1. Annihilation takes place if the mass of cellular automaton decreases at each iteration until all cells are in the state 0. We consider classes of cellular automata such that the state of cell at the next time depends on the state at current time and states of neighboring cells belonging to fixed set. We have found sets of cellular automata such that the mass conservation law, explosion or annihilation takes place for these automata.

APA, Harvard, Vancouver, ISO, and other styles

14

Adamatzky, Andrew. "Automatic programming of cellular automata: identification approach." Kybernetes 26, no. 2 (March 1997): 126–35. http://dx.doi.org/10.1108/03684929710163074.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

DOLZHENKO, EGOR, and NATAŠA JONOSKA. "TWO-DIMENSIONAL LANGUAGES AND CELLULAR AUTOMATA." International Journal of Foundations of Computer Science 23, no. 01 (January 2012): 185–206. http://dx.doi.org/10.1142/s0129054112500037.

Full text

Abstract:

Space-time diagrams of a one-dimensional cellular automaton can be visualized as half-plane arrays of symbols. The set of rectangular blocks extracted from such arrays forms a two-dimensional (picture) language. We initiate a study of cellular automata through the associated two dimensional languages by investigating cellular automata whose two-dimensional languages are factorial-local. We show that these cellular automata have the same characterization as one-sided cellular automata with SFT traces.

APA, Harvard, Vancouver, ISO, and other styles

16

BEIGY, HAMID, and M. R. MEYBODI. "OPEN SYNCHRONOUS CELLULAR LEARNING AUTOMATA." Advances in Complex Systems 10, no. 04 (December 2007): 527–56. http://dx.doi.org/10.1142/s0219525907001264.

Full text

Abstract:

Cellular learning automata is a combination of learning automata and cellular automata. This model is superior to cellular learning automata because of its ability to learn and also is superior to single learning automaton because it is a collection of learning automata which can interact together. In some applications such as image processing, a type of cellular learning automata in which the action of each cell in the next stage of its evolution not only depends on the local environment (actions of its neighbors) but it also depends on the external environments. We call such a cellular learning automata as open cellular learning automata. In this paper, we introduce open cellular learning automata and then study its steady state behavior. It is shown that for a class of rules called commutative rules, the open cellular learning automata in stationary external environments converges to a stable and compatible configuration. Then the application of this new model to image segmentation has been presented.

APA, Harvard, Vancouver, ISO, and other styles

17

Kari, Jarkko, Ville Salo, and Thomas Worsch. "Sequentializing cellular automata." Natural Computing 19, no. 4 (June 1, 2019): 759–72. http://dx.doi.org/10.1007/s11047-019-09745-7.

Full text

Abstract:

Abstract We study the problem of sequentializing a cellular automaton without introducing any intermediate states, and only performing reversible permutations on the tape. We give a decidable characterization of cellular automata which can be written as a single sweep of a bijective rule from left to right over an infinite tape. Such cellular automata are necessarily left-closing, and they move at least as much information to the left as they move information to the right.

APA, Harvard, Vancouver, ISO, and other styles

18

Das, Sukanta, and Mihir K. Chakraborty. "Formal Logic of Cellular Automata." Complex Systems 30, no. 2 (June 15, 2021): 187–203. http://dx.doi.org/10.25088/complexsystems.30.2.187.

Full text

Abstract:

This paper develops a formal logic, named L CA , targeting modeling of one-dimensional binary cellular automata. We first develop the syntax of L CA , then give semantics to L CA in the domain of all binary strings. Then the elementary cellular automata and four-neighborhood binary cellular automata are shown as models of the logic. These instances point out that there are other models of L CA . Finally it is proved that any one-dimensional binary cellular automaton is a model of the proposed logic.

APA, Harvard, Vancouver, ISO, and other styles

19

BEIGY, HAMID, and M. R. MEYBODI. "A MATHEMATICAL FRAMEWORK FOR CELLULAR LEARNING AUTOMATA." Advances in Complex Systems 07, no. 03n04 (September 2004): 295–319. http://dx.doi.org/10.1142/s0219525904000202.

Full text

Abstract:

The cellular learning automata, which is a combination of cellular automata, and learning automata, is a new recently introduced model. This model is superior to cellular automata because of its ability to learn and is also superior to a single learning automaton because it is a collection of learning automata which can interact with each other. The basic idea of cellular learning automata, which is a subclass of stochastic cellular learning automata, is to use the learning automata to adjust the state transition probability of stochastic cellular automata. In this paper, we first provide a mathematical framework for cellular learning automata and then study its convergence behavior. It is shown that for a class of rules, called commutative rules, the cellular learning automata converges to a stable and compatible configuration. The numerical results also confirm the theoretical investigations.

APA, Harvard, Vancouver, ISO, and other styles

20

HSIUNG, MING. "Elementary cellular automata and self-referential paradoxes." Journal of Logic and Computation 30, no. 3 (April 2020): 745–63. http://dx.doi.org/10.1093/logcom/exaa022.

Full text

Abstract:

Abstract We associate an elementary cellular automaton with a set of self-referential sentences, whose revision process is exactly the evolution process of that automaton. A simple but useful result of this connection is that a set of self-referential sentences is paradoxical, iff (the evolution process for) the cellular automaton in question has no fixed points. We sort out several distinct kinds of paradoxes by the existence and features of the fixed points of their corresponding automata. They are finite homogeneous paradoxes and infinite homogeneous paradoxes. In some weaker sense, we will also introduce no-no-sort paradoxes and virtual paradoxes. The introduction of these paradoxes, in turn, leads to a new classification of the cellular automata.

APA, Harvard, Vancouver, ISO, and other styles

21

Turney, Peter D. "Measuring Behavioral Similarity of Cellular Automata." Artificial Life 27, no. 1 (2021): 62–71. http://dx.doi.org/10.1162/artl_a_00337.

Full text

Abstract:

Abstract Conway's Game of Life is the best-known cellular automaton. It is a classic model of emergence and self-organization, it is Turing-complete, and it can simulate a universal constructor. The Game of Life belongs to the set of semi-totalistic cellular automata, a family with 262,144 members. Many of these automata may deserve as much attention as the Game of Life, if not more. The challenge we address here is to provide a structure for organizing this large family, to make it easier to find interesting automata, and to understand the relations between automata. Packard and Wolfram (1985) divided the family into four classes, based on the observed behaviors of the rules. Eppstein (2010) proposed an alternative four-class system, based on the forms of the rules. Instead of a class-based organization, we propose a continuous high-dimensional vector space, where each automaton is represented by a point in the space. The distance between two automata in this space corresponds to the differences in their behavioral characteristics. Nearest neighbors in the space have similar behaviors. This space should make it easier for researchers to see the structure of the family of semi-totalistic rules and to find the hidden gems in the family.

APA, Harvard, Vancouver, ISO, and other styles

22

Ravichandran, Ramprasad, Sung Kyu Lim, and Mike Niemier. "Automatic cell placement for quantum-dot cellular automata." Integration 38, no. 3 (January 2005): 541–48. http://dx.doi.org/10.1016/j.vlsi.2004.07.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Pino, Neisser, and Gabriel Wainer. "Un Modelo Computacional de la Transmisión del Dengue por Autómatas Celulares." Selecciones Matemáticas 6, no. 2 (December 30, 2019): 217–24. http://dx.doi.org/10.17268/sel.mat.2019.02.08.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Chouksey, Jayshree, and Er Deepak Pancholi. "Review Paper on Quantum Dot Cellular Automata Using Nanoelectronics." International Journal of Trend in Scientific Research and Development Volume-2, Issue-5 (August 31, 2018): 2205–7. http://dx.doi.org/10.31142/ijtsrd18214.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Sargolzaei, A., K. K. Yen, K. Zeng, S. M. A. Motahari, and S. Noei. "Impulse Image Noise Reduction Using Fuzzy-Cellular Automata Method." International Journal of Computer and Electrical Engineering 6, no. 2 (2014): 191–95. http://dx.doi.org/10.7763/ijcee.2014.v6.820.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Lee, Chung-Hwan, Dong-jin Hong Lee, Eui-young Cha, and Sung-Hyo Yun. "Implementation of Lava Flow Simulation Program Using Cellular Automata." Journal of the Petrological Society of Korea 26, no. 1 (March 31, 2017): 93–98. http://dx.doi.org/10.7854/jpsk.2017.26.1.93.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

KŮRKA, PETR. "Languages, equicontinuity and attractors in cellular automata." Ergodic Theory and Dynamical Systems 17, no. 2 (April 1997): 417–33. http://dx.doi.org/10.1017/s014338579706985x.

Full text

Abstract:

We consider three related classifications of cellular automata: the first is based on the complexity of languages generated by clopen partitions of the state space, i.e. on the complexity of the factor subshifts; the second is based on the concept of equicontinuity and it is a modification of the classification introduced by Gilman [9]. The third one is based on the concept of attractors and it refines the classification introduced by Hurley [16]. We show relations between these classifications and give examples of cellular automata in the intersection classes. In particular, we show that every positively expansive cellular automaton is conjugate to a one-sided subshift of finite type and that every topologically transitive cellular automaton is sensitive to initial conditions. We also construct a cellular automaton with minimal quasi-attractor, whose basin has measure zero, answering a question raised in Hurley [16].

APA, Harvard, Vancouver, ISO, and other styles

28

MORA, JUAN CARLOS SECK TUOH, MANUEL GONZÁLEZ HERNÁANDEZ, GENARO JUÁREZ MARTÍNEZ, and SERGIO V. CHAPA VERGARA. "EXTENSIONS IN REVERSIBLE ONE-DIMENSIONAL CELLULAR AUTOMATA ARE EQUIVALENT WITH THE FULL SHIFT." International Journal of Modern Physics C 14, no. 08 (October 2003): 1143–60. http://dx.doi.org/10.1142/s012918310300525x.

Full text

Abstract:

Cellular automata are discrete dynamical systems based on simple local interactions among its components, but sometimes they are able to yield quite a complex global behavior. A special kind of cellular automaton is the one where the global behavior is invertible, this type of cellular automaton is called reversible. In this paper we expose the graph representation provided by de Bruijn diagrams of reversible one-dimensional cellular automata and we define the distinct types of paths between self-loops in such diagrams. With this, we establish the way in which a reversible one-dimensional cellular automaton generates sequences composed by subsequences produced by the undefined repetition of a single state. Using this graph presentation, we define Welch diagrams which will be useful for proving that all the extensions of the ancestors in reversible one-dimensional cellular automata are equivalent to the full shift. In this way an important result of this paper is that we understand and classify the behavior of a reversible automaton analyzing the extensions of the ancestors of a given sequence by means of symbolic dynamics tools. A final example illustrates the results exposed in the paper.

APA, Harvard, Vancouver, ISO, and other styles

29

DEL REY, A. MARTÍN, and G. RODRÍGUEZ SÁNCHEZ. "ON THE REVERSIBILITY OF 150 WOLFRAM CELLULAR AUTOMATA." International Journal of Modern Physics C 17, no. 07 (July 2006): 975–83. http://dx.doi.org/10.1142/s0129183106009680.

Full text

Abstract:

In this paper, the reversibility problem for 150 Wolfram cellular automata is tackled for null boundary conditions. It is explicitly shown that the reversibility depends on the number of cells of the cellular automaton. The inverse cellular automaton for each case is also computed.

APA, Harvard, Vancouver, ISO, and other styles

30

Bilan, S. M. "EVOLUTION OF TWO-DIMENSIONAL CELLULAR AUTOMATA. NEW FORMS OF PRESENTATION." Ukrainian Journal of Information Technology 3, no. 1 (2021): 85–90. http://dx.doi.org/10.23939/ujit2021.03.085.

Full text

Abstract:

The paper considers cellular automata and forms of reflection of their evolution. Forms of evolution of elementary cellular automata are known and widely used, which allowed specialists to model different dynamic processes and behavior of systems in different directions. In the context of the easy construction of the form of evolution of elementary cellular automata, difficulties arise in representing the form of evolution of two-dimensional cellular automata, both synchronous and asynchronous. The evolution of two-dimensional cellular automata is represented by a set of states of two-dimensional forms of cellular automata, which complicates the perception and determination of the dynamics of state change. The aim of this work is to solve the problem of a fixed mapping of the evolution of a two-dimensional cellular automaton in the form of a three-dimensional representation, which is displayed in different colors on a two-dimensional image The paper proposes the evolution of two-dimensional cellular automata in the form of arrays of binary codes for each cell of the field. Each time step of the state change is determined by the state of the logical "1" or "0". Moreover, each subsequent state is determined by increasing the binary digit by one. The resulting binary code identifies the color code that is assigned to the corresponding cell at each step of the evolution iteration. As a result of such coding, a two-dimensional color matrix (color image) is formed, which in its color structure indicates the evolution of a two-dimensional cellular automaton. To represent evolution, Wolfram coding was used, which increases the number of rules for a two-dimensional cellular automaton. The rules were used for the von Neumann neighborhood without taking into account the own state of the analyzed cell. In accordance with the obtained two-dimensional array of codes, a discrete color image is formed. The color of each pixel of such an image is encoded by the obtained evolution code of the corresponding cell of the two-dimensional cellular automaton with the same coordinates. The bitness of the code depends on the number of time steps of evolution. The proposed approach allows us to trace the behavior of the cellular automaton in time depending on its initial states. Experimental analysis of various rules for the von Neumann neighborhood made it possible to determine various rules that allow the shift of an image in different directions, as well as various affine transformations over images. Using this approach, it is possible to describe various dynamic processes and natural phenomena.

APA, Harvard, Vancouver, ISO, and other styles

31

Kim, Ho-Soo, and Min-Ho Lee. "Optimal Shape Design of Space Truss Structure using Topology Optimization and Cellular Automata Model." Journal of the Computational Structural Engineering Institute of Korea 25, no. 1 (February 29, 2012): 73–80. http://dx.doi.org/10.7734/coseik.2012.25.1.073.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

MORA, JUAN CARLOS SECK TUOH, SERGIO V. CHAPA VERGARA, GENARO JUÁREZ MARTÍNEZ, and HAROLD V. McINTOSH. "SPECTRAL PROPERTIES OF REVERSIBLE ONE-DIMENSIONAL CELLULAR AUTOMATA." International Journal of Modern Physics C 14, no. 03 (March 2003): 379–95. http://dx.doi.org/10.1142/s0129183103004541.

Full text

Abstract:

Reversible cellular automata are invertible dynamical systems characterized by discreteness, determinism and local interaction. This article studies the local behavior of reversible one-dimensional cellular automata by means of the spectral properties of their connectivity matrices. We use the transformation of every one-dimensional cellular automaton to another of neighborhood size 2 to generalize the results exposed in this paper. In particular we prove that the connectivity matrices have a single positive eigenvalue equal to 1; based on this result we also prove the idempotent behavior of these matrices. The significance of this property lies in the implementation of a matrix technique for detecting whether a one-dimensional cellular automaton is reversible or not. In particular, we present a procedure using the eigenvectors of these matrices to find the inverse rule of a given reversible one-dimensional cellular automaton. Finally illustrative examples are provided.

APA, Harvard, Vancouver, ISO, and other styles

33

Lohn, J. D., and J. A. Reggia. "Automatic discovery of self-replicating structures in cellular automata." IEEE Transactions on Evolutionary Computation 1, no. 3 (1997): 165–78. http://dx.doi.org/10.1109/4235.661547.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Straatman, Bas, Roger White, and Guy Engelen. "Towards an automatic calibration procedure for constrained cellular automata." Computers, Environment and Urban Systems 28, no. 1-2 (January 2004): 149–70. http://dx.doi.org/10.1016/s0198-9715(02)00068-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

MARTÍNEZ, GENARO J., ANDREW ADAMATZKY, CHRISTOPHER R. STEPHENS, and ALEJANDRO F. HOEFLICH. "CELLULAR AUTOMATON SUPERCOLLIDERS." International Journal of Modern Physics C 22, no. 04 (April 2011): 419–39. http://dx.doi.org/10.1142/s0129183111016348.

Full text

Abstract:

Gliders in one-dimensional cellular automata are compact groups of non-quiescent and non-ether patterns (ether represents a periodic background) translating along automaton lattice. They are cellular automaton analogous of localizations or quasi-local collective excitations traveling in a spatially extended nonlinear medium. They can be considered as binary strings or symbols traveling along a one-dimensional ring, interacting with each other and changing their states, or symbolic values, as a result of interactions. We analyze what types of interaction occur between gliders traveling on a cellular automaton "cyclotron" and build a catalog of the most common reactions. We demonstrate that collisions between gliders emulate the basic types of interaction that occur between localizations in nonlinear media: fusion, elastic collision, and soliton-like collision. Computational outcomes of a swarm of gliders circling on a one-dimensional torus are analyzed via implementation of cyclic tag systems.

APA, Harvard, Vancouver, ISO, and other styles

36

Nemtsev, Aleksander, Sergey Kalashnikov, and Xudong Luo. "Cellular-automaton modeling of gas sorption kinetics in the finite volume of coal." E3S Web of Conferences 330 (2021): 04004. http://dx.doi.org/10.1051/e3sconf/202133004004.

Full text

Abstract:

The work is devoted to cellular-automaton modeling based on a class of cellular automata with Margolus neighborhood. Modeling of the gas sorption process by coal particle was carried out. To organize this kind of evolutionary process, the method of cellular automata modeling was supplemented by the Monte Carlo method to implement the boundary conditions at the solid – gas interface.

APA, Harvard, Vancouver, ISO, and other styles

37

STÄMPFLE, M. "CELLULAR AUTOMATA AND OPTIMAL PATH PLANNING." International Journal of Bifurcation and Chaos 06, no. 03 (March 1996): 603–10. http://dx.doi.org/10.1142/s0218127496000291.

Full text

Abstract:

Cellular automata are deterministic dynamical systems in which time, space, and state values are discrete. Although they consist of uniform elements, which interact only locally, cellular automata are capable of showing complex behavior. This property is exploited for solving path planning problems in workspaces with obstacles. A new automaton rule is presented which calculates simultaneously all shortest paths between a starting position and a target cell. Based on wave propagation, the algorithm ensures that the dynamics settles down in an equilibrium state which represents an optimal solution. Rule extensions include calculations with multiple starts and targets. The method allows applications on lattices and regular, weighted graphs of any finite dimension. In comparison with algorithms from graph theory or neural network theory, the cellular automaton approach has several advantages: Convergence towards optimal configurations is guaranteed, and the computing costs depend only linearly on the lattice size. Moreover, no floating-point calculations are involved.

APA, Harvard, Vancouver, ISO, and other styles

38

He, Jun Lian, and Ming Tian Li. "Cellular Automata to Simulate Crack Propagation of Quasi-Brittle Materials." Applied Mechanics and Materials 90-93 (September 2011): 748–51. http://dx.doi.org/10.4028/www.scientific.net/amm.90-93.748.

Full text

Abstract:

Crack propagation in quasi-brittle material such as rock and concrete is studied by a new numerical method, lattice cellular automata. Cellular automaton method is an efficient method that simulates the process of self-organization of the complex system by constructing some simple local rules. It is of the advantage of localization and parallelization. Lattice model can transform a complex triaxial problem into a simpler uniaxial problem as well as consider the heterogeneity of the materials. Lattice cellular automata integrate advantages of both cellular automata and lattice model. In this paper the importance of the study of crack propagation, fundamentals and applications of cellular automata are briefly introduced firstly. Then the cellular automata model is presented, and in order to verify lattice cellular automata, the propagation of mode-I crack in homogeneous material is studied. Results of the numerical simulation are in good accordance with the experimental results and theoretical results of classical fracture mechanics. Furthermore, based on lattice cellular automata, the crack propagation of single crack under uniaxial compression was simulated. During the crack growth the wing crack and secondary cracks were found. The simulation results were consistent with the experimental results.

APA, Harvard, Vancouver, ISO, and other styles

39

Fatès, Nazim, Irène Marcovici, and Siamak Taati. "Self-stabilisation of Cellular Automata on Tilings." Fundamenta Informaticae 185, no. 1 (March 18, 2022): 27–82. http://dx.doi.org/10.3233/fi-222103.

Full text

Abstract:

Given a finite set of local constraints, we seek a cellular automaton (i.e., a local and uniform algorithm) that self-stabilises on the configurations that satisfy these constraints. More precisely, starting from a finite perturbation of a valid configuration, the cellular automaton must eventually fall back into the space of valid configurations where it remains still. We allow the cellular automaton to use extra symbols, but in that case, the extra symbols can also appear in the initial finite perturbation. For several classes of local constraints (e.g., k-colourings with k ≠ 3, and North-East deterministic constraints), we provide efficient self-stabilising cellular automata with or without additional symbols that wash out finite perturbations in linear or quadratic time, but also show that there are examples of local constraints for which the self-stabilisation problem is inherently hard. We note that the optimal self-stabilisation speed is the same for all local constraints that are isomorphic to one another. We also consider probabilistic cellular automata rules and show that in some cases, the use of randomness simplifies the problem. In the deterministic case, we show that if finite perturbations are corrected in linear time, then the cellular automaton self-stabilises even starting from a random perturbation of a valid configuration, that is, when errors in the initial configuration occur independently with a sufficiently low density.

APA, Harvard, Vancouver, ISO, and other styles

40

SABLIK, MATHIEU. "Measure rigidity for algebraic bipermutative cellular automata." Ergodic Theory and Dynamical Systems 27, no. 6 (December 2007): 1965–90. http://dx.doi.org/10.1017/s0143385707000247.

Full text

Abstract:

AbstractLet $({\mathcal {A}^{\mathbb {Z}}} ,F)$ be a bipermutative algebraic cellular automaton. We present conditions that force a probability measure, which is invariant for the $ {\mathbb {N}} \times {\mathbb {Z}} $-action of F and the shift map σ, to be the Haar measure on Σ, a closed shift-invariant subgroup of the abelian compact group $ {\mathcal {A}^{\mathbb {Z}}} $. This generalizes simultaneously results of Host et al (B. Host, A. Maass and S. Martínez. Uniform Bernoulli measure in dynamics of permutative cellular automata with algebraic local rules. Discrete Contin. Dyn. Syst. 9(6) (2003), 1423–1446) and Pivato (M. Pivato. Invariant measures for bipermutative cellular automata. Discrete Contin. Dyn. Syst. 12(4) (2005), 723–736). This result is applied to give conditions which also force an (F,σ)-invariant probability measure to be the uniform Bernoulli measure when F is a particular invertible affine expansive cellular automaton on $ {\mathcal {A}^{\mathbb {N}}} $.

APA, Harvard, Vancouver, ISO, and other styles

41

Bahrepour, Davoud. "A Novel Full Comparator Design Based on Quantum-Dot Cellular Automata." International Journal of Information and Electronics Engineering 5, no. 6 (2015): 406–10. http://dx.doi.org/10.7763/ijiee.2015.v5.568.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Afanasyev, I. V. "Клеточно-автоматная модель динамики численности организмов озера Байкал." Prikladnaya diskretnaya matematika, no. 15 (March 1, 2012): 121–32. http://dx.doi.org/10.17223/20710410/15/9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Cha, Ju-Hwan, Sol Ha, and Kyu-Yeul Lee. "Evacuation Analysis for a Passenger Ship Using a Cellular Automata Model with Group Behavior." Journal of the Korea Society for Simulation 20, no. 4 (December 31, 2011): 149–55. http://dx.doi.org/10.9709/jkss.2011.20.4.149.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Hasanzadeh Mofrad, Mohammad, Sana Sadeghi, Alireza Rezvanian, and Mohammad Reza Meybodi. "Cellular edge detection: Combining cellular automata and cellular learning automata." AEU - International Journal of Electronics and Communications 69, no. 9 (September 2015): 1282–90. http://dx.doi.org/10.1016/j.aeue.2015.05.010.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Ruivo, Eurico L. P., and Pedro P. B. de Oliveira. "Inferring the Limit Behavior of Some Elementary Cellular Automata." International Journal of Bifurcation and Chaos 27, no. 08 (July 2017): 1730028. http://dx.doi.org/10.1142/s0218127417300282.

Full text

Abstract:

Cellular automata locally define dynamical systems, discrete in space, time and in the state variables, capable of displaying arbitrarily complex global emergent behavior. One core question in the study of cellular automata refers to their limit behavior, that is, to the global dynamical features in an infinite time evolution. Previous works have shown that for finite time evolutions, the dynamics of one-dimensional cellular automata can be described by regular languages and, therefore, by finite automata. Such studies have shown the existence of growth patterns in the evolution of such finite automata for some elementary cellular automata rules and also inferred the limit behavior of such rules based upon the growth patterns; however, the results on the limit behavior were obtained manually, by direct inspection of the structures that arise during the time evolution. Here we present the formalization of an automatic method to compute such structures. Based on this, the rules of the elementary cellular automata space were classified according to the existence of a growth pattern in their finite automata. Also, we present a method to infer the limit graph of some elementary cellular automata rules, derived from the analysis of the regular expressions that describe their behavior in finite time. Finally, we analyze some attractors of two rules for which we could not compute the whole limit set.

APA, Harvard, Vancouver, ISO, and other styles

46

Bhardwaj, Rupali, and Anil Upadhyay. "Cellular Automata." Journal of Organizational and End User Computing 29, no. 1 (January 2017): 42–50. http://dx.doi.org/10.4018/joeuc.2017010103.

Full text

Abstract:

Cellular automata (CA) are discrete dynamical systems consist of a regular finite grid of cell; each cell encapsulating an equal portion of the state, and arranged spatially in a regular fashion to form an n-dimensional lattice. A cellular automata is like computers, data represented by initial configurations which is processed by time evolution to produce output. This paper is an empirical study of elementary cellular automata which includes concepts of rule equivalence, evolution of cellular automata and classification of cellular automata. In addition, explanation of behaviour of cellular automata is revealed through example.

APA, Harvard, Vancouver, ISO, and other styles

47

Bandini, S. "Cellular automata." Future Generation Computer Systems 18, no. 7 (August 2002): v—vi. http://dx.doi.org/10.1016/s0167-739x(02)00067-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Kutrib, Martin, Roland Vollmar, and Thomas Worsch. "Cellular automata." Parallel Computing 23, no. 11 (November 1997): 1565. http://dx.doi.org/10.1016/s0167-8191(97)82081-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Manuceau, Vincent. "About decentralized swarms of asynchronous distributed cellular automata using inter-planetary file system’s publish-subscribe experimental implementation." International Journal of Informatics and Communication Technology (IJ-ICT) 11, no. 1 (April 1, 2022): 32. http://dx.doi.org/10.11591/ijict.v11i1.pp32-44.

Full text

Abstract:

This research describes the simple implementation of asynchronous distributed cellular automata and decentralized swarms of asynchronous distributed cellular automata built on top of inter-planetary file system’s publish-subscribe (IPFS PubSub) experimentation. Various publish-subscribe(PubSub) models are described. As an illustration, two distributed versions and a decentralized swarm version of a 2D elementary cellular automaton are thoroughly detailed to highlight the simplicity of implementation with IPFS and the inner workings of these kinds of cellular automata (CA). Both algorithms were implemented, and experiments were conducted throughout five datacenters of Grid’5000 testbed in France to obtain preliminary performance results in terms of network bandwidth usage. This work is prior to implementing a large-scale decentralized epidemic propagation modeling and prediction system based upon asynchronous distributed cellular automata with application to the current pandemic of SARS-CoV-2 coronavirus disease 2019 (COVID-19).

APA, Harvard, Vancouver, ISO, and other styles

50

ADAMATZKY, ANDREW, and LEON CHUA. "MEMRISTIVE EXCITABLE CELLULAR AUTOMATA." International Journal of Bifurcation and Chaos 21, no. 11 (November 2011): 3083–102. http://dx.doi.org/10.1142/s0218127411030611.

Full text

Abstract:

The memristor is a device whose resistance changes depending on the polarity and magnitude of a voltage applied to the device's terminals. We design a minimalistic model of a regular network of memristors using structurally-dynamic cellular automata. Each cell gets info about states of its closest neighbors via incoming links. A link can be "conductive" or "nonconductive". States of every link are updated depending on the states of cells the link connects. Every cell of a memristive automaton assumes three states: resting, excited (analog of positive polarity) and refractory (analog of negative polarity). A cell updates its state depending on states of its closest neighbors which are connected to the cell via "conductive" links. We study behavior of memristive automata in response to point-wise and spatially extended perturbations, structure of localized excitations coupled with topological defects, interfacial mobile excitations and growth of information pathways.

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!