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

Automata networks are a very general model of interacting entities, withapplications to biological phenomena such as gene regulation. In many contexts,the order in which entities update their state is unknown, and the dynamics maybe very sensitive to changes in this schedule of updates. Since the works ofAracena et. al, it is known that update digraphs are pertinent objects to studynon-equivalent block-sequential update schedules. We prove that counting thenumber of equivalence classes, that is a tight upper bound on the synchronismsensitivity of a given network, is #P-complete. The problem is neverthelesscomputable in quasi-quadratic time for oriented cacti, and for orientedseries-parallel graphs thanks to a decomposition method.

#P-completeness of counting update digraphs, cacti, and a series-parallel decomposition method