scholarly journals On two-way communication in cellular automata with a fixed number of cells

2005 ◽  
Vol 330 (2) ◽  
pp. 325-338 ◽  
Author(s):  
Andreas Malcher
Keyword(s):  
Cellular Automata ◽  
Fixed Number ◽  
Number Of Cells

scholarly journals The Size of One-Way Cellular Automata

2010 ◽  
Vol DMTCS Proceedings vol. AL,... (Proceedings) ◽  
Author(s):  
Martin Kutrib ◽  
Jonas Lefèvre ◽  
Andreas Malcher
Keyword(s):  
Cellular Automata ◽  
Real Time ◽  
Finite Automata ◽  
Fixed Number ◽  
Point Of View ◽  
Upper And Lower Bounds ◽  
Worst Case ◽  
Order Of Magnitude ◽  
International Audience ◽  
Number Of Cells

International audience We investigate the descriptional complexity of basic operations on real-time one-way cellular automata with an unbounded as well well as a fixed number of cells. The size of the automata is measured by their number of states. Most of the bounds shown are tight in the order of magnitude, that is, the sizes resulting from the effective constructions given are optimal with respect to worst case complexity. Conversely, these bounds also show the maximal savings of size that can be achieved when a given minimal real-time OCA is decomposed into smaller ones with respect to a given operation. From this point of view the natural problem of whether a decomposition can algorithmically be solved is studied. It turns out that all decomposition problems considered are algorithmically unsolvable. Therefore, a very restricted cellular model is studied in the second part of the paper, namely, real-time one-way cellular automata with a fixed number of cells. These devices are known to capture the regular languages and, thus, all the problems being undecidable for general one-way cellular automata become decidable. It is shown that these decision problems are $\textsf{NLOGSPACE}$-complete and thus share the attractive computational complexity of deterministic finite automata. Furthermore, the state complexity of basic operations for these devices is studied and upper and lower bounds are given.

On efficiency of estimation and testing with data quantized to fixed number of cells

Metrika ◽  
2003 ◽  
Vol 57 (1) ◽  
pp. 1-27 ◽  
Author(s):  
A. M. Mayoral ◽  
D. Morales ◽  
J. Morales ◽  
I. Vajda
Keyword(s):  
Fixed Number ◽  
Number Of Cells

Adaptability and Homeostasis in the Game of Life interacting with the evolved Cellular Automata

2012 ◽  
pp. 232-254
Author(s):  
Keisuke Suzuki ◽  
Takashi Ikegami
Keyword(s):  
Genetic Algorithm ◽  
Cellular Automata ◽  
Space Time ◽  
Layer System ◽  
Game Of Life ◽  
Time Dynamic ◽  
State 1 ◽  
Number Of Cells

In this paper, the authors study the emergence of homeostasis in a two-layer system of the Game of Life, in which the Game of Life in the first layer couples with another system of cellular automata in the second layer. Homeostasis is defined as a space-time dynamic that regulates the number of cells in state-1 in the Game of Life layer. A genetic algorithm is used to evolve the rules of the second layer to control the pattern of the Game of Life. The authors found that two antagonistic attractors control the numbers of cells in state-1 in the first layer. The homeostasis sustained by these attractors is compared with the homeostatic dynamics observed in Daisy World.

ON THE REVERSIBILITY OF 150 WOLFRAM CELLULAR AUTOMATA

2006 ◽  
Vol 17 (07) ◽  
pp. 975-983 ◽  
Author(s):  
A. MARTÍN DEL REY ◽  
G. RODRÍGUEZ SÁNCHEZ
Keyword(s):  
Cellular Automata ◽  
Boundary Conditions ◽  
Cellular Automaton ◽  
Number Of Cells

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.

On Pattern Selection in Three-Dimensional Bénard-Marangoni Flows

2012 ◽  
Vol 11 (3) ◽  
pp. 893-924 ◽  
Author(s):  
Arne Morten Kvarving ◽  
Tormod Bjøntegaard ◽  
Einar M. Rønquist
Keyword(s):  
Numerical Experiments ◽  
Initial Conditions ◽  
Computational Study ◽  
Fluid Layer ◽  
Three Dimensional ◽  
Fixed Number ◽  
Random Initial Condition ◽  
Initial Condition ◽  
Convection Pattern ◽  
Number Of Cells

AbstractIn this paper we study Bénard-Marangoni convection in confined containers where a thin fluid layer is heated from below. We consider containers with circular, square and hexagonal cross-sections. For Marangoni numbers close to the critical Marangoni number, the flow patterns are dominated by the appearance of the well-known hexagonal convection cells. The main purpose of this computational study is to explore the possible patterns the system may end up in for a given set of parameters. In a series of numerical experiments, the coupled fluid-thermal system is started with a zero initial condition for the velocity and a random initial condition for the temperature. For a given set of parameters we demonstrate that the system can end up in more than one state. For example, the final state of the system may be dominated by a steady convection pattern with a fixed number of cells, however, the same system may occasionally end up in a steady pattern involving a slightly different number of cells, or it may end up in a state where most of the cells are stationary, while one or more cells end up in an oscillatory state. For larger aspect ratio containers, we are also able to reproduce dislocations in the convection pattern, which have also been observed experimentally. It has been conjectured that such imperfections (e.g., a localized star-like pattern) are due to small irregularities in the experimental setup (e.g., the geometry of the container). However, we show, through controlled numerical experiments, that such phenomena may appear under otherwise ideal conditions. By repeating the numerical experiments for the same non-dimensional numbers, using a different random initial condition for the temperature in each case, we are able to get an indication of how rare such events are. Next, we study the effect of symmetrizing the initial conditions. Finally, we study the effect of selected geometry deformations on the resulting convection patterns.

Adaptability and Homeostasis in the Game of Life interacting with the evolved Cellular Automata

2010 ◽  
Vol 1 (3) ◽  
pp. 40-50
Author(s):  
Keisuke Suzuki ◽  
Takashi Ikegami
Keyword(s):  
Genetic Algorithm ◽  
Cellular Automata ◽  
Space Time ◽  
Layer System ◽  
Game Of Life ◽  
Time Dynamic ◽  
State 1 ◽  
Number Of Cells

In this paper, the authors study the emergence of homeostasis in a two-layer system of the Game of Life, in which the Game of Life in the first layer couples with another system of cellular automata in the second layer. Homeostasis is defined as a space-time dynamic that regulates the number of cells in state-1 in the Game of Life layer. A genetic algorithm is used to evolve the rules of the second layer to control the pattern of the Game of Life. The authors found that two antagonistic attractors control the numbers of cells in state-1 in the first layer. The homeostasis sustained by these attractors is compared with the homeostatic dynamics observed in Daisy World.

An Ultra-Low-Power Five-Input Majority Gate in Quantum-Dot Cellular Automata

2020 ◽  
Vol 29 (11) ◽  
pp. 2050176
Author(s):  
Feifei Deng ◽  
Guangjun Xie ◽  
Shaowei Wang ◽  
Xin Cheng ◽  
Yongqiang Zhang
Keyword(s):  
Cellular Automata ◽  
Power Consumption ◽  
Low Power ◽  
Power Dissipation ◽  
Single Layer ◽  
Full Adder ◽  
Majority Gate ◽  
Ultra Low Power ◽  
Quantum Dot Cellular Automata ◽  
Number Of Cells

Quantum-dot cellular automata (QCA) is a highly attractive alternative to CMOS for future digital circuit design, relying on its high-performance and low-power-consumption features. This paper analyzes and compares previously published five-input majority gates. These designs do not perform well in terms of physical properties, especially concerting power consumption. Therefore, an ultra-low-power five-input majority gate in one layer is proposed, which uses a minimum number of cells and smaller area, and achieves the expected highly polarized output compared with previous designs. In order to evaluate its practicability, a new one-bit coplanar full-adder is proposed. The analysis results show that this full-adder performs well compared with existing multilayer and single-layer designs. The number of cells of the proposed design is reduced by 7.14% to get the same area and clock delay compared with the best coplanar full-adder. In addition, its power dissipation is also reduced by 9.28% at 0.5[Formula: see text], 11.09% at 1[Formula: see text] and 12.66% at 1.5[Formula: see text] in terms of average energy dissipation compared with the best single-layer design. QCADesigner tool is used to verify the simulation results of the proposed designs and QCAPro tool is used to evaluate the power dissipation of all considered designs.

Ripple Carry Adder Using Two XOR Gates in QCA

2013 ◽  
Vol 467 ◽  
pp. 531-535 ◽  
Author(s):  
Kandula Suresh ◽  
Bahniman Ghosh
Keyword(s):  
Cellular Automata ◽  
Quantum Dot ◽  
Digital Circuits ◽  
Quantum Dot Cellular Automata ◽  
Ripple Carry Adder ◽  
Number Of Cells

Quantum-dot Cellular Automata (QCA) is a very recent technology which can be used for developing new digital circuits which use very less power [1-2]. This paper mainly aims at using XOR gates to implementation of adder circuit in lesser number of cells and with a higher density.

scholarly journals OPTIMIZATION OF 2D LATTICE CELLULAR AUTOMATA FOR PSEUDORANDOM NUMBER GENERATION

2005 ◽  
Vol 16 (03) ◽  
pp. 479-500 ◽  
Author(s):  
MARIE THERESE ROBLES QUIETA ◽  
SHENG-UEI GUAN
Keyword(s):  
Genetic Algorithm ◽  
Cellular Automata ◽  
Neighborhood Characteristics ◽  
Structure And Properties ◽  
Pseudorandom Number Generation ◽  
The Cost ◽  
Number Of Cells ◽  
Better Than ◽  
2D Array

This paper proposes a generalized approach to 2D CA PRNGs — the 2D lattice CA PRNG — by introducing vertical connections to arrays of 1D CA. The structure of a 2D lattice CA PRNG lies in between that of 1D CA and 2D CA grid PRNGs. With the generalized approach, 2D lattice CA PRNG offers more 2D CA PRNG variations. It is found that they can do better than the conventional 2D CA grid PRNGs. In this paper, the structure and properties of 2D lattice CA are explored by varying the number and location of vertical connections, and by searching for different 2D array settings that can give good randomness based on Diehard test. To get the most out of 2D lattice CA PRNGs, genetic algorithm is employed in searching for good neighborhood characteristics. By adopting an evolutionary approach, the randomness quality of 2D lattice CA PRNGs is optimized. In this paper, a new metric, #rn is introduced as a way of finding a 2D lattice CA PRNG with the least number of cells required to pass Diehard test. Following the introduction of the new metric #rn, a cropping technique is presented to further boost the CA PRNG performance. The cost and efficiency of 2D lattice CA PRNG is compared with past works on CA PRNGs.

Sign in / Sign up

Export Citation Format

Share Document