English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

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

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