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 present a 4-state solution to the Firing SquadSynchronization Problem (FSSP) based on hybrid rule 60/102 CellularAutomata(CA). This solution solves the problem on the line of length 2^n withtwo generals. Previous work on FSSP for 4-state systems focused mostly onlinear cellular automata, where synchronizes an infinite number of lines butnot all possible lines. We give time-optimal solutions to synchronize aninfinite number of lines by rule 60 and rule 102 respectively, and construct ahybrid rule 60 and 102 states transition table. Compared to the known solutionsof cellular automata, the hybrid CA way is simpler and faster, the minimal timeis (n-1) step.

A 4-state solution to the Firing Squad Synchronization Problem based on hybrid rule 60 and 102 cellular automata