English
Related papers

Related papers: A new universal cellular automaton on the ternary …

200 papers

In this paper, we construct a cellular automaton on the heptagrid which is planar, weakly universal and which have three states only. This result improves the best result which was with four states.

Discrete Mathematics · Computer Science 2014-10-08 Maurice Margenstern

In this paper, we construct a cellular automaton on the pentagrid which is planar, weakly universal and which have five states only. This result much improves the best result which was with nine states

Cellular Automata and Lattice Gases · Physics 2014-03-12 Maurice Margenstern

In this paper we prove that there is a weakly universal weighted cellular automaton in the heptagrid, the tessellation {7,3} of the hyperbolic plane, with 6 states. The present paper improves the same result deposited on arXiv:2301.10691v1…

Formal Languages and Automata Theory · Computer Science 2023-03-29 Maurice Margenstern

In this paper, we prove that there is a strongly universal cellular automaton on the heptagrid with six states which is rotation invariant. This improves a previous paper of the author with 7 states. Here, the structures are modified and…

Formal Languages and Automata Theory · Computer Science 2023-05-05 Maurice Margenstern

In this paper, we prove that there is a strongly universal cellular automaton on the heptagrid with seven states which is rotation invariant. This improves a previous paper of the author where the automaton required ten states.

Discrete Mathematics · Computer Science 2021-02-09 Maurice Margenstern

In this paper, we significantly improve a previous result by the same author showing the existence of a weakly universal cellular automaton with five states living in the hyperbolic 3D-space. Here, we get such a cellular automaton with…

Formal Languages and Automata Theory · Computer Science 2010-03-02 Margenstern Maurice

In this paper, we show a construction of a weakly universal cellular automaton in the 3D hyperbolic space with two states. The cellular automaton is rotation invariant and, moreover, based on a new implementation of a railway circuit in the…

Formal Languages and Automata Theory · Computer Science 2010-05-27 Maurice Margenstern

In this paper, we prove that there is an outer totalistic weakly universal cellular automaton in the dodecagrid, the tessellation {5,3,4} of the hyperbolic 3D space, with four states. It is the first result in such a context.

Computational Geometry · Computer Science 2021-08-31 Maurice Margenstern

In this paper, we prove that there is a weakly universal cellular automaton on the pentagrid with two states. This paper improves in some sense a previous result with three states. Both results make use of \textit{\`a la Moore}…

Discrete Mathematics · Computer Science 2016-02-16 Maurice Margenstern

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…

Discrete Mathematics · Computer Science 2013-09-09 Maurice Margenstern

In this paper, following the way opened by a previous paper deposited on arXiv, we give an upper bound to the number of states for a hyperbolic cellular automaton in the pentagrid. Indeed, we prove that there is a hyperbolic cellular…

Formal Languages and Automata Theory · Computer Science 2010-06-18 Maurice Margenstern

In this paper, we construct a family of weakly universal rotation invariant cellular automaton for all grids $\{p,3\}$ of the hyperbolic plane for $p\geq 13$. The scheme is general for $p\geq 17$ and for $13\leq p<17$, we give such a…

Formal Languages and Automata Theory · Computer Science 2012-02-09 Maurice Margenstern

In this paper, we prove that there is a strongly universal cellular automaton in the dodecagrid, the tessellation {5,3,4} of the hyperbolic 3D-space, with five states which is rotation invariant. This improves a previous paper of the author…

Discrete Mathematics · Computer Science 2021-05-25 Maurice Margenstern

In this paper, we prove that there is a weakly universal cellular automaton on the pentagrid with three states which is rotation invariant and which uses \`a la Moore neighbourhood. Moreover, at each step of the computation, the set of non…

Discrete Mathematics · Computer Science 2015-11-02 Maurice Margenstern

In this paper, we construct a weakly universal cellular automaton with two states only on the tiling {11,3}. The cellular automaton is rotation invariant and it is a true planar one.

Cellular Automata and Lattice Gases · Physics 2015-01-27 Maurice Margenstern

In this paper, we construct a weakly universal cellular automaton in the heptagrid, the tessellation $\{7,3\}$ which is not rotation invariant but which is truly planar. This result, under these conditions, cannot be improved for the…

Discrete Mathematics · Computer Science 2016-07-22 Maurice Margenstern

In this paper, we construct a weakly universal cellular automaton on the tessellation $\{9,3\}$ which has two states and which is not rotation invariant but which is truly planar.

Discrete Mathematics · Computer Science 2016-06-01 Maurice Margenstern

In this paper, we prove that there is a strongly universal cellular automaton on the pentagrid with six states. For each cell c, Moore neighbourhood consists of the cells which share a vertex with c. Moreover, the rules are rotation…

Cellular Automata and Lattice Gases · Physics 2023-09-20 Maurice Margenstern

In this paper, we prove that there is a strongly universal cellular automaton in the dodecagrid, the tesselllation {5,3,4} of the hyperbolic 3D space, with four states but, it is not rotation invariant as the automaton of arXiv:2104.01561…

Cellular Automata and Lattice Gases · Physics 2021-07-13 Maurice Margenstern

In this paper, we look at the extention of Hedlund's characterization of cellular automata to the case of cellular automata in the hyperbolic plane. This requires an additionnal condition. The new theorem is proved with full details in the…

Discrete Mathematics · Computer Science 2011-03-29 Maurice Margenstern
‹ Prev 1 2 3 10 Next ›