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

It is known that elementary cellular automaton rule 110 is capable ofsupporting universal computation by emulating cyclic tag system. Since thewhole information necessary to perform computation is stored in theconfiguration, it is reasonable to investigate the complexity of configurationfor the analysis of computing process. In this research we employed Lempel-Zivcomplexity as a measure of complexity and calculated it during the evolution ofemulating cyclic tag system by rule 110. As a result, we observed the stepwisedecline of complexity during the evolution. That is caused by thetransformation from table data to moving data and the elimination of table databy a rejector.

Complexity Analysis in Cyclic Tag System Emulated by Rule 110