AbstractThe paper gives the construction of a universal CA with 22 states in the regular rectangular pentagonal grid of the hyperbolic plane. The CA implements a railway circuit which simulates a register machine and which improves a bit already known railway simulations of a Turing machine
A reversible (or injective) cellular automaton (RCA) is a "backward deterministic" CA, i.e., every c...
International audienceIn this paper, we consider the relation between spatial machines, Turing machi...
Abstract. Cellular automata are a simple model of parallel computation. Many people wonder about the...
AbstractThe paper gives the construction of a universal CA with 22 states in the regular rectangular...
AbstractIn this paper, we construct a new weakly universal cellular automaton on the ternary heptagr...
In this paper, we introduce a new technique in order to deal with cellular automata in the hyperboli...
In this paper, we construct a strongly universal cellular automaton on the line with 11 states and t...
In this paper, we construct a strongly universal cellular automaton on the line with 11 states and t...
AbstractIn this paper, we define cellular automata on a grid of the hyperbolic plane that is based o...
The study of cellular automata (CA) on tilings of hyperbolic plane was initiated in [6]. Appropriate...
AbstractA reversible cellular automaton (RCA) is a cellular automaton (CA) whose global function is ...
We show how reversible computers can be built in very simple two-dimensional cellular automata calle...
AbstractIn this paper, we describe a quasi-linear time universal cellular automaton. This cellular a...
Universality of Cellular Automata (CA) is the ability to develop arbitrary computations, and is view...
This report consists in two main parts. The first deals with the simulation of cellular automata by ...
A reversible (or injective) cellular automaton (RCA) is a "backward deterministic" CA, i.e., every c...
International audienceIn this paper, we consider the relation between spatial machines, Turing machi...
Abstract. Cellular automata are a simple model of parallel computation. Many people wonder about the...
AbstractThe paper gives the construction of a universal CA with 22 states in the regular rectangular...
AbstractIn this paper, we construct a new weakly universal cellular automaton on the ternary heptagr...
In this paper, we introduce a new technique in order to deal with cellular automata in the hyperboli...
In this paper, we construct a strongly universal cellular automaton on the line with 11 states and t...
In this paper, we construct a strongly universal cellular automaton on the line with 11 states and t...
AbstractIn this paper, we define cellular automata on a grid of the hyperbolic plane that is based o...
The study of cellular automata (CA) on tilings of hyperbolic plane was initiated in [6]. Appropriate...
AbstractA reversible cellular automaton (RCA) is a cellular automaton (CA) whose global function is ...
We show how reversible computers can be built in very simple two-dimensional cellular automata calle...
AbstractIn this paper, we describe a quasi-linear time universal cellular automaton. This cellular a...
Universality of Cellular Automata (CA) is the ability to develop arbitrary computations, and is view...
This report consists in two main parts. The first deals with the simulation of cellular automata by ...
A reversible (or injective) cellular automaton (RCA) is a "backward deterministic" CA, i.e., every c...
International audienceIn this paper, we consider the relation between spatial machines, Turing machi...
Abstract. Cellular automata are a simple model of parallel computation. Many people wonder about the...
DOI
Add to ORKG