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 rise to strongly universal cellular automata with 10 states
This note is a survey of examples and results about cellular automata with the purpose of recalling ...
AbstractUniversality in cellular automata (CAs), first studied by von Neumann, has attracted much re...
International audienceIn this paper we investigate certain properties of semi-totalistic cellular au...
In this paper, we construct a strongly universal cellular automaton on the line with 11 states and t...
AbstractThe paper gives the construction of a universal CA with 22 states in the regular rectangular...
International audienceThis paper presents a 1D intrinsically universal cellular automaton with four ...
AbstractThis paper presents a 1D intrinsically universal cellular automaton with four states for the...
The existence of computation-universal one-dimensional cellular automata with seven states per cell ...
AbstractIn this paper, we construct a new weakly universal cellular automaton on the ternary heptagr...
Abstract. Cellular automata are a simple model of parallel computation. Many people wonder about the...
In this paper, we introduce a new technique in order to deal with cellular automata in the hyperboli...
AbstractIn this paper, we construct the first weakly universal cellular automaton on the ternary hep...
Abstract. This reading guide aims to provide the reader with an easy access to the study of universa...
Universality of Cellular Automata (CA) is the ability to develop arbitrary computations, and is view...
Cellular automata (CA) are dynamical systems defined by a finite local rule but they are studied for...
This note is a survey of examples and results about cellular automata with the purpose of recalling ...
AbstractUniversality in cellular automata (CAs), first studied by von Neumann, has attracted much re...
International audienceIn this paper we investigate certain properties of semi-totalistic cellular au...
In this paper, we construct a strongly universal cellular automaton on the line with 11 states and t...
AbstractThe paper gives the construction of a universal CA with 22 states in the regular rectangular...
International audienceThis paper presents a 1D intrinsically universal cellular automaton with four ...
AbstractThis paper presents a 1D intrinsically universal cellular automaton with four states for the...
The existence of computation-universal one-dimensional cellular automata with seven states per cell ...
AbstractIn this paper, we construct a new weakly universal cellular automaton on the ternary heptagr...
Abstract. Cellular automata are a simple model of parallel computation. Many people wonder about the...
In this paper, we introduce a new technique in order to deal with cellular automata in the hyperboli...
AbstractIn this paper, we construct the first weakly universal cellular automaton on the ternary hep...
Abstract. This reading guide aims to provide the reader with an easy access to the study of universa...
Universality of Cellular Automata (CA) is the ability to develop arbitrary computations, and is view...
Cellular automata (CA) are dynamical systems defined by a finite local rule but they are studied for...
This note is a survey of examples and results about cellular automata with the purpose of recalling ...
AbstractUniversality in cellular automata (CAs), first studied by von Neumann, has attracted much re...
International audienceIn this paper we investigate certain properties of semi-totalistic cellular au...
DOI
Add to ORKG