scholarly journals Sequentializing cellular automata

2019 ◽  
Vol 19 (4) ◽  
pp. 759-772 ◽  
Author(s):  
Jarkko Kari ◽  
Ville Salo ◽  
Thomas Worsch
Keyword(s):  
Cellular Automata ◽  
Cellular Automaton ◽  
Intermediate States ◽  
The Right

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.

scholarly journals Characterization of the Evolution of Nonlinear Uniform Cellular Automata in the Light of Deviant States

2011 ◽  
Vol 2011 ◽  
pp. 1-16 ◽  
Author(s):  
Pabitra Pal Choudhury ◽  
Sudhakar Sahoo ◽  
Mithun Chakraborty
Keyword(s):  
Cellular Automata ◽  
Cellular Automaton ◽  
Boolean Functions ◽  
State Transition ◽  
The State ◽  
Transition Diagram ◽  
One Dimensional ◽  
State Transition Diagram ◽  
Linear Rule

Dynamics of a nonlinear cellular automaton (CA) is, in general asymmetric, irregular, and unpredictable as opposed to that of a linear CA, which is highly systematic and tractable, primarily due to the presence of a matrix handle. In this paper, we present a novel technique of studying the properties of the State Transition Diagram of a nonlinear uniform one-dimensional cellular automaton in terms of its deviation from a suggested linear model. We have considered mainly elementary cellular automata with neighborhood of size three, and, in order to facilitate our analysis, we have classified the Boolean functions of three variables on the basis of number and position(s) of bit mismatch with linear rules. The concept of deviant and nondeviant states is introduced, and hence an algorithm is proposed for deducing the State Transition Diagram of a nonlinear CA rule from that of its nearest linear rule. A parameter called the proportion of deviant states is introduced, and its dependence on the length of the CA is studied for a particular class of nonlinear rules.

Pseudorandom Number Generators Based on Cellular Automata With the Hexagonal Coverage

2017 ◽  
pp. 139-156
Keyword(s):  
Cellular Automata ◽  
Cellular Automaton ◽  
Random Number ◽  
The State ◽  
Time Step ◽  
Random Number Generators ◽  
Asynchronous Cellular Automata ◽  
Local Functions ◽  
Initial Settings ◽  
The Right

The seventh chapter describes approaches to constructing pseudo-random number generators based on cellular automata with a hexagonal coating. Several variants of cellular automata with hexagonal coating are considered. Asynchronous cellular automata with hexagonal coating are used. To simulate such cellular automata with software, a hexagonal coating was formed using an orthogonal coating. At the same time, all odd lines shifted to the cell floor to the right or to the left. The neighborhood of each cell contains six neighboring cells that have one common side with one cell of neighborhood. The chapter considers the behavior of cellular automata for different sizes and different initial settings. The behavior of cellular automata with various local functions is described, as well as the behavior of the cellular automaton with an additional bit inverting the state of the cell in each time step of functioning.

A Study on Overtaking Taffic Rules in Two-Lane System Based on Cellular Automaton Model

2014 ◽  
Vol 644-650 ◽  
pp. 2479-2483
Author(s):  
Shuai Lu
Keyword(s):  
Cellular Automata ◽  
Cellular Automaton ◽  
Road Traffic ◽  
Highway Safety ◽  
Cellular Automaton Model ◽  
Highway Traffic ◽  
Traffic Capacity ◽  
Simulation Results ◽  
The Right ◽  
Traffic Rules

This paper studied three traffic rules under the situation of highway straight using the idea of cellular automata, and established the cellular automaton model of two-lane highway (situation of highway straight) for running but not allowing overtaking, the cellular automaton model of two-lane highway (situation of highway straight) for running on the right side and overtaking from the left side, and cellular automaton model of two-lane highway (situation of highway straight) for running on both sides and freely overtaking. This paper defines the concepts such as congestion probability, free passage probability, vehicles entering the highway probability, etc, in which, the congestion density is used to characterize the security of road traffic (the greater the congestion probability is, the less safety); free passage probability is used to evaluate the highway traffic capacity (the greater is the free passage probability, the better is the highway traffic capacity). Based on the simulation results, we can know about the two-lane freely overtaking rules have some effect in improving highway safety and traffic capacity.

Simulating Self-Regeneration and Self-Replication Processes Using Movable Cellular Automata with a Mutual Equilibrium Neighborhood

2020 ◽  
Vol 29 (4) ◽  
pp. 741-757
Author(s):  
Kateryna Hazdiuk ◽  
◽  
Volodymyr Zhikharevich ◽  
Serhiy Ostapov ◽  
◽  
...  
Keyword(s):  
Cellular Automata ◽  
Cellular Automaton ◽  
Three Dimensional ◽  
Computer Models ◽  
The Self ◽  
Model Construction ◽  
Natural Phenomena ◽  
Different Types ◽  
Movable Cellular Automata ◽  
Self Replication

This paper deals with the issue of model construction of the self-regeneration and self-replication processes using movable cellular automata (MCAs). The rules of cellular automaton (CA) interactions are found according to the concept of equilibrium neighborhood. The method is implemented by establishing these rules between different types of cellular automata (CAs). Several models for two- and three-dimensional cases are described, which depict both stable and unstable structures. As a result, computer models imitating such natural phenomena as self-replication and self-regeneration are obtained and graphically presented.

scholarly journals Functional Characterization of the mazEF Toxin-Antitoxin System in the Pathogenic Bacterium Agrobacterium tumefaciens

2021 ◽  
Vol 9 (5) ◽  
pp. 1107
Author(s):  
Wonho Choi ◽  
Yoshihiro Yamaguchi ◽  
Ji-Young Park ◽  
Sang-Hyun Park ◽  
Hyeok-Won Lee ◽  
...  
Keyword(s):  
Agrobacterium Tumefaciens ◽  
Physiological Function ◽  
Functional Characterization ◽  
Site Directed Mutagenesis ◽  
In Vitro Assays ◽  
Cell Growth Inhibition ◽  
The Right

Agrobacterium tumefaciens is a pathogen of various plants which transfers its own DNA (T-DNA) to the host plants. It is used for producing genetically modified plants with this ability. To control T-DNA transfer to the right place, toxin-antitoxin (TA) systems of A. tumefaciens were used to control the target site of transfer without any unintentional targeting. Here, we describe a toxin-antitoxin system, Atu0939 (mazE-at) and Atu0940 (mazF-at), in the chromosome of Agrobacterium tumefaciens. The toxin in the TA system has 33.3% identity and 45.5% similarity with MazF in Escherichia coli. The expression of MazF-at caused cell growth inhibition, while cells with MazF-at co-expressed with MazE-at grew normally. In vivo and in vitro assays revealed that MazF-at inhibited protein synthesis by decreasing the cellular mRNA stability. Moreover, the catalytic residue of MazF-at was determined to be the 24th glutamic acid using site-directed mutagenesis. From the results, we concluded that MazF-at is a type II toxin-antitoxin system and a ribosome-independent endoribonuclease. Here, we characterized a TA system in A. tumefaciens whose understanding might help to find its physiological function and to develop further applications.

scholarly journals Characterization of Spatial Planning in Brazil: The Right to the City in Theory and Practice

2019 ◽  
Vol 34 (4) ◽  
pp. 419-437 ◽  
Author(s):  
Roberto Rocco ◽  
Luciana Royer ◽  
Fábio Mariz Gonçalves
Keyword(s):  
Spatial Planning ◽  
Theory And Practice ◽  
Right To The City ◽  
The Right ◽  
The City

A STUDY OF BIFURCATIONS IN A CIRCULAR REAL CELLULAR AUTOMATON

1993 ◽  
Vol 03 (02) ◽  
pp. 293-321 ◽  
Author(s):  
JÜRGEN WEITKÄMPER
Keyword(s):  
Hopf Bifurcation ◽  
Dynamical Systems ◽  
Cellular Automata ◽  
Cellular Automaton ◽  
Parallel Computers ◽  
Discrete Dynamical Systems ◽  
Two Dimensional ◽  
Bifurcation Structure ◽  
Logistic Mapping ◽  
Henon Mapping

Real cellular automata (RCA) are time-discrete dynamical systems on ℝN. Like cellular automata they can be obtained from discretizing partial differential equations. Due to their structure RCA are ideally suited to implementation on parallel computers with a large number of processors. In a way similar to the Hénon mapping, the system we consider here embeds the logistic mapping in a system on ℝN, N>1. But in contrast to the Hénon system an RCA in general is not invertible. We present some results about the bifurcation structure of such systems, mostly restricting ourselves, due to the complexity of the problem, to the two-dimensional case. Among others we observe cascades of cusp bifurcations forming generalized crossroad areas and crossroad areas with the flip curves replaced by Hopf bifurcation curves.

An efficiently computable characterization of stability and instability for linear cellular automata

2021 ◽  
Author(s):  
Alberto Dennunzio ◽  
Enrico Formenti ◽  
Darij Grinberg ◽  
Luciano Margara
Keyword(s):  
Cellular Automata ◽  
Stability And Instability
Sign in / Sign up

Export Citation Format

Share Document