Related papers: Exploring Ancient Architectural Designs with Cellu…
We present ongoing work on a tool that consists of two parts: (i) A raw micro-level abstract world simulator with an interface to (ii) a 3D game engine, translator of raw abstract simulator data to photorealistic graphics. Part (i)…
Here I describe a view of the evolution of cellular automata that allows to operate on larger structures. Instead of calculating the next state of all cells in one step, the method here developed uses a time slice that can proceed at…
This contribution belongs to a combinatorial approach to hyperbolic geometry and it is aimed at possible applications to computer simulations. It is based on the splitting method which was introduced by the author and which is reminded in…
Parallel algorithms for solving any image processing task is a highly demanded approach in the modern world. Cellular Automata (CA) are the most common and simple models of parallel computation. So, CA has been successfully used in the…
A place to live is one of the most crucial necessities for all living organisms since the advent of life on planet Earth. The nature of homes has changed considerably over time. At the very early stages, human begins lived in natural places…
Number-conserving cellular automata are discrete dynamical systems that simulate interacting particles like e.g. grains of sand. In an earlier paper, I had already derived a uniform construction for all transition rules of one-dimensional…
In this paper, we construct a strongly universal cellular automaton on the line with 11 states and the standard neighbourhood. We embed this construction into several tilings of the hyperbolic plane and of the hyperbolic 3D space giving…
In this paper, we propose a new approach for building cellular automata to solve real-world segmentation problems. We design and train a cellular automaton that can successfully segment high-resolution images. We consider a colony that…
We present a 2-dimensional cellular automaton model for the simulation of pedestrian dynamics. The model is extremely efficient and allows simulations of large crowds faster than real time since it includes only nearest-neighbour…
The notions of universality and completeness are central in the theories of computation and computational complexity. However, proving lower bounds and necessary conditions remains hard in most of the cases. In this article, we introduce…
Cellular Automata (CA) are commonly investigated as a particular type of dynamical systems, defined by shift-invariant local rules. In this paper, we consider instead CA as algebraic systems, focusing on the combinatorial designs induced by…
Cryptographic schemes using one-dimensional, three-neighbor cellular automata as a primitive have been put forth since at least 1985. Early results showed good statistical pseudorandomness, and the simplicity of their construction made them…
We show how to convert models of complex systems such as 2D cellular automata into a 3D printed object. Our method takes into account the limitations inherent to 3D printing processes and materials. Our approach automates the greater part…
Studies of quantum computer implementations suggest cellular quantum computer architectures. These architectures can simulate the evolution of quantum cellular automata, which can possibly simulate both quantum and classical physical…
Inspired by the approach of kinetic theory of gases, a three-level description (microscopic, mesoscopic and macroscopic) of cellular automaton is presented. To provide an analytical treatment a simple domino cellular automaton with…
Maximum length CA has wide range of applications in design of linear block code, cryptographic primitives and VLSI testing particularly in Built-In-Self-Test. In this paper, an algorithm to compute all $n$-cell maximum length CA-rule…
In a probabilistic cellular automaton in which all local transitions have positive probability, the problem of keeping a bit of information indefinitely is nontrivial, even in an infinite automaton. Still, there is a solution in 2…
In a recent paper [arXiv:1506.06649 [nlin.CG]], we presented an example of a 3-state cellular automaton which exhibits behaviour analogous to degenerate hyperbolicity often observed in finite-dimensional dynamical systems. We also…
A coarse-grained cellular automaton is proposed to simulate traffic systems. There, cells represent road sections. A cell can be in two states: jammed or passable. Numerical calculations are performed for a piece of square lattice with open…
In this paper, we look at two ways to implement determinisitic one dimensional cellular automata into hyperbolic cellular automata in three contexts: the pentagrid, the heptagrid and the dodecagrid, these tilings being classically denoted…