The study of factoring relations between subshifts or cellular automata is central in symbolic dynamics. Besides, a notion of intrinsic universality for cellular automata based on ...
A cellular automaton (CA) is a parallel synchronous computing model, which consists in a juxtaposition of finite automata (cells) whose state evolves according to that of their ne...
We study a binary-cell-states eight-cell neighborhood two-dimensional cellular automaton model of a quasi-chemical system with a substrate and a reagent. Reactions are represented...
One potentially cost-effective approach to harvesting solar power from space is the use of thousands of individual robots moving in formation, each with a piece of solar panel att...
This paper investigates how portability of a model between different computer operating systems can lead to increased efficiency in code execution. The portability problem is not a...