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 Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

One-dimensional cellular automata evolutions with both temporal and spatial periodicity are studied. The main objective is to investigate the longest temporal periods among all two-neighbor rules, with a fixed spatial period σ and number of states n. When σ = 2, 3, 4 or 6, and the rules are restricted to be additive, the longest period can be expressed as the exponent of the multiplicative group of an appropriate ring. Non-additive rules are also constructed with temporal period on the same order as the trivial upper bound n σ . Experimental results, open problems and possible extensions of the results are also discussed.

Maximal Temporal Period of a Periodic Solution Generated by a One-Dimensional Cellular Automaton