500 search results - page 11 / 100 » Universality and Cellular Automata |
CORR
2010
Springer
14 years 9 months ago
2010
Springer
This paper is the second part of a series of two papers dealing with bulking: a way to define quasi-order on cellular automata by comparing space-time diagrams up to rescaling. In...
STACS
2010
Springer
15 years 4 months ago
2010
Springer
We show that the Tile Assembly Model exhibits a strong notion of universality where the goal is to give a single tile assembly system that simulates the behavior of any other tile...
73
Voted
HYBRID
2003
Springer
15 years 2 months ago
2003
Springer
The algorithmic analysis of timed automata is fundamentally limited by the undecidability of the universality problem. For this reason and others, there has been considerable inter...
IPPS
2003
IEEE
15 years 2 months ago
2003
IEEE
The paper presents new results concerning application of cellular automata (CAs) to the secret key cryptography
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Topological dynamics of cellular automata (CA), inherited from classical dynamical systems theory, has been essentially studied in