Sciweavers

1035 search results - page 53 / 207
» Communications in cellular automata
Sort
View
ACRI
2006
Springer
14 years 4 months ago
CA Simulation of Biological Evolution in Genetic Hyperspace
Abstract. Realistic simulation of biological evolution by necessity requires simplification and reduction in the dimensionality of the corresponding dynamic system. Even when this...
Michael A. Saum, Sergey Gavrilets
GLVLSI
1999
IEEE
90views VLSI» more  GLVLSI 1999»
14 years 2 months ago
A Memory Design in QCAs using the SQUARES Formalism
We present a formalism for implementing circuits with Quantum-dot Cellular Automata (QCA), comprising a set of standard circuit elements with uniform layout rules. The formalism s...
Daniel Berzon, Terry J. Fountain
MCU
1998
170views Hardware» more  MCU 1998»
13 years 11 months ago
About the Universality of the Billiard ball model
Block cellular automata (BCA) make local, parallel, synchronous and uniform updates of in nite lattices. In the one-dimensionalcase, there exist BCA with 11 states which are unive...
Jérôme Olivier Durand-Lose
DAM
2002
125views more  DAM 2002»
13 years 10 months ago
Complexity of Langton's ant
The virtual ant introduced by Langton [Physica D 22 (1986) 120] has an interesting behavior, which has been studied in several contexts. Here we give a construction to calculate a...
Anahí Gajardo, Andrés Moreira, Eric ...
FOSSACS
2008
Springer
13 years 11 months ago
Optimal Lower Bounds on Regular Expression Size Using Communication Complexity
The problem of converting deterministic finite automata into (short) regular expressions is considered. It is known that the required expression size is 2(n) in the worst case for ...
Hermann Gruber, Jan Johannsen