UNIVERSAL CELLULAR AUTOMATON OVER A HEXAGONAL TILING WITH 3 STATES

2001 ◽  
Vol 11 (03) ◽  
pp. 335-354 ◽  
Author(s):  
A. GAJARDO ◽  
E. GOLES
Keyword(s):  
Cellular Automaton ◽  
Digital Circuits ◽  
Transition Rule ◽  
Local Transition ◽  
Hexagonal Tiling ◽  
The Way

A universal three-state three-neighbor cellular automaton will be constructed. The space selected for this cellular automaton is a hexagonal tiling where the cells are in the vertices and the neighbors are the three nearest cells. We define the local transition rule as well as the basic elements that will aid to build digital circuits and, by the way, prove the universality of this cellular automaton. The local transition rule is defined to be isotropic.

ON SPIRAL GLIDER-GUNS IN HEXAGONAL CELLULAR AUTOMATA: ACTIVATOR-INHIBITOR PARADIGM

2006 ◽  
Vol 17 (07) ◽  
pp. 1009-1026 ◽  
Author(s):  
ANDREW WUENSCHE ◽  
ANDREW ADAMATZKY
Keyword(s):  
Cellular Automaton ◽  
Complex Dynamics ◽  
Reaction Diffusion ◽  
Dimensional Lattice ◽  
Excitable System ◽  
Rich Diversity ◽  
Dependent Inhibition ◽  
Computational Properties ◽  
Activator Inhibitor ◽  
Hexagonal Tiling

We present a cellular-automaton model of a reaction-diffusion excitable system with concentration dependent inhibition of the activator, and study the dynamics of mobile localizations (gliders) and their generators. We analyze a three-state totalistic cellular automaton on a two-dimensional lattice with hexagonal tiling, where each cell connects with 6 others. We show that a set of specific rules support spiral glider-guns (rotating activator-inhibitor spirals emitting mobile localizations) and stationary localizations which destroy or modify gliders, along with a rich diversity of emergent structures with computational properties. We describe how structures are created and annihilated by glider collisions, and begin to explore the necessary processes that generate this kind of complex dynamics.

scholarly journals Performance Improvement Strategies of Analog & Mixed Circuits

2019 ◽  
Vol 8 (9S) ◽  
pp. 297-301
Keyword(s):  
Performance Improvement ◽  
Power Dissipation ◽  
Digital Circuits ◽  
Analog To Digital ◽  
Nano Scale ◽  
Improvement Strategies ◽  
Analog And Digital Circuits ◽  
Analog Domain ◽  
Intermediate Role ◽  
The Way

In modern days technology becomes very advanced and it moves from analog to digital domain. Everything depends on one and zero frame. In any case, the foundation of any computerized circuit is constantly simple and without simple can't envision this world. ADCs play an intermediate role between analog and digital circuits. Analog and mixed circuits are basic piece of any gadget and there are bunches of works in analog domain for researcher. This paper is extremely helpful for understanding the extent of analog and mixed circuits, also give description about various smart techniques which help to improve the performance of the device. Presently gadgets turn out to be little because of scaling and circuits works on nano-scale process so area become comparably very small but on the penalty of power dissipation which is important term for consideration. This paper additionally talked about different way to deal with decrease control supply. It is thoroughly legitimizes the way that Analog is exceptionally amazing area for researcher.

An Implementation of von Neumann's Self-Reproducing Machine

1995 ◽  
Vol 2 (4) ◽  
pp. 337-354 ◽  
Author(s):  
Umberto Pesavento
Keyword(s):  
Cellular Automaton ◽  
State Transition ◽  
The State ◽  
Transition Rule ◽  
John Von Neumann ◽  
Von Neumann ◽  
Special Case

This article describes in detail an implementation of John von Neumann's self-reproducing machine. Self-reproduction is achieved as a special case of construction by a universal constructor. The theoretical proof of the existence of such machines was given by John von Neumann in the early 1950s [6], but was first implemented in 1994, by the author in collaboration with R. Nobili. Our implementation relies on an extension of the state-transition rule of von Neumann's original cellular automaton. This extension was introduced to simplify the design of the constructor. The main operations in our constructor can be mapped into operations of von Neumann's machine.

Models and Paradigms of Cellular Automata With Several Active Cells

2021 ◽  
pp. 55-74
Keyword(s):  
Cellular Automata ◽  
Cellular Automaton ◽  
Local State ◽  
State Function ◽  
State Control ◽  
Time Step ◽  
Transition Functions ◽  
Asynchronous Cellular Automata ◽  
Control Schemes ◽  
Local Transition

The chapter describes the models and paradigms of asynchronous cellular automata with several active cells. Variants of active states are considered in which an asynchronous cellular automaton functions without loss of active cells. Structures that allow the coincidence of several active states in one cell of a cellular automaton are presented. The cell scheme is complicated by adding several active triggers and state control schemes for active triggers. The VHDL models of such cells were developed. Attention is paid to the choice of local state functions and local transition functions. The local transition functions are different for each active state. This allows you to transmit active signals in different directions. At each time step, two cells can change their information state according to the local state function. Asynchronous cellular automata have a long lifecycle.

The Cognitive Domain of a Glider in the Game of Life

2014 ◽  
Vol 20 (2) ◽  
pp. 183-206 ◽  
Author(s):  
Randall D. Beer
Keyword(s):  
Cellular Automaton ◽  
Technical Detail ◽  
Cognitive Domain ◽  
Communicative Interaction ◽  
Structural Coupling ◽  
Game Of Life ◽  
Enactive Approach ◽  
Concrete Model ◽  
The Way

This article examines in some technical detail the application of Maturana and Varela's biology of cognition to a simple concrete model: a glider in the game of Life cellular automaton. By adopting an autopoietic perspective on a glider, the set of possible perturbations to it can be divided into destructive and nondestructive subsets. From a glider's reaction to each nondestructive perturbation, its cognitive domain is then mapped. In addition, the structure of a glider's possible knowledge of its immediate environment, and the way in which that knowledge is grounded in its constitution, are fully described. The notion of structural coupling is then explored by characterizing the paths of mutual perturbation that a glider and its environment can undergo. Finally, a simple example of a communicative interaction between two gliders is given. The article concludes with a discussion of the potential implications of this analysis for the enactive approach to cognition.

BUILDING EFFICIENT COMPUTATIONAL CELLULAR AUTOMATA MODELS OF COMPLEX SYSTEMS: BACKGROUND, APPLICATIONS, RESULTS, SOFTWARE, AND PATHOLOGIES

2019 ◽  
Vol 22 (05) ◽  
pp. 1950013 ◽  
Author(s):  
JIŘÍ KROC ◽  
FRANCISCO JIMÉNEZ-MORALES ◽  
J. L. GUISADO ◽  
MARÍA CARMEN LEMOS ◽  
JAKUB TKÁČ
Keyword(s):  
Cellular Automata ◽  
Complex Systems ◽  
Cellular Automaton ◽  
Transition Rule ◽  
Large Variability ◽  
Computational Approaches ◽  
Laser Dynamics ◽  
Flow Diagrams ◽  
Software Codes ◽  
Definition Of

Cellular automaton models of complex systems (CSs) are gaining greater popularity; simultaneously, they have proven the capability to solve real scientific and engineering applications. To enable everybody a quick penetration into the core of this type of modeling, three real applications of cellular automaton models, including selected open source software codes, are studied: laser dynamics, dynamic recrystallization (DRX) and surface catalytic reactions. The paper is written in a way that it enables any researcher to reach the cutting edge knowledge of the design principles of cellular automata (CA) models of the observed phenomena in any scientific field. The whole sequence of design steps is demonstrated: definition of the model using topology and local (transition) rule of a cellular automaton, achieved results, comparison to real experiments, calibration, pathological observations, flow diagrams, software, and discussions. Additionally, the whole paper demonstrates the extreme expressiveness and flexibility of massively parallel computational approaches compared to other computational approaches. The paper consists of the introductory parts that are explaining CSs, self-organization and emergence, entropy, and CA. This allows readers to realize that there is a large variability in definitions and solutions of this class of models.

scholarly journals Two-Lane Traffic Flow Simulation Model via Cellular Automaton

2012 ◽  
Vol 2012 ◽  
pp. 1-6 ◽  
Author(s):  
Kamini Rawat ◽  
Vinod Kumar Katiyar ◽  
Pratibha Gupta
Keyword(s):  
Cellular Automaton ◽  
Traffic Flow ◽  
Road Traffic ◽  
Flow Simulation ◽  
Transition Rule ◽  
Fundamental Diagram ◽  
Lane Changing ◽  
Acceleration Rate ◽  
Traffic Flow Simulation ◽  
The Individual

Road traffic microsimulations based on the individual motion of all the involved vehicles are now recognized as an important tool to describe, understand, and manage road traffic. Cellular automata (CA) are very efficient way to implement vehicle motion. CA is a methodology that uses a discrete space to represent the state of each element of a domain, and this state can be changed according to a transition rule. The well-known cellular automaton Nasch model with modified cell size and variable acceleration rate is extended to two-lane cellular automaton model for traffic flow. A set of state rules is applied to provide lane-changing maneuvers. S-t-s rule given in the BJH model which describes the behavior of jammed vehicle is implemented in the present model and effect of variability in traffic flow on lane-changing behavior is studied. Flow rate between the single-lane road and two-lane road where vehicles change the lane in order to avoid the collision is also compared under the influence of s-t-s rule and braking rule. Using results of numerical simulations, we analyzed the fundamental diagram of traffic flow and show that s-t-s probability has more effect than braking probability on lane-changing maneuver.

Sign in / Sign up

Export Citation Format

Share Document