DeepAI AI Chat
Log In Sign Up

Millions of 5-State n^3 Sequence Generators via Local Mappings

by   Tien Nguyen, et al.

In this paper, we come back on the notion of local simulation allowing to transform a cellular automaton into a closely related one with different local encoding of information. In a previous paper, we applied it to the Firing Squad Synchronization Problem. In this paper, we show that the approach is not tied to this problem by applying it to the class of Real-Time Sequence Generation problems. We improve in particular on the generation of n 3 sequence by using local mappings to obtain millions of 5state solution, one of them using 58 transitions. It is based on the solution of Kamikawa and Umeo that uses 6 states and 74 transitions. Then, we explain in which sense even bigger classes of problems can be considered.


page 6

page 9


Tensor methods for the computation of MTTA in large systems of loosely interconnected components

We are concerned with the computation of the mean-time-to-absorption (MT...

Aquanims – Area-Preserving Animated Transitions based on a Hydraulic Metaphor

We propose "Aquanims" as new design metaphors for animated transitions t...

An effective method for computing Grothendieck point residue mappings

Grothendieck point residue is considered in the context of computational...

Plan Development using Local Probabilistic Models

Approximate models of world state transitions are necessary when buildin...

Learning Diverse Stochastic Human-Action Generators by Learning Smooth Latent Transitions

Human-motion generation is a long-standing challenging task due to the r...

Metaphor Generation with Conceptual Mappings

Generating metaphors is a difficult task as it requires understanding nu...

Any Regular Polyhedron Can Transform to Another by O(1) Refoldings

We show that several classes of polyhedra are joined by a sequence of O(...