Pages that link to "Item:Q2446312"
From MaRDI portal
The following pages link to On the number of update digraphs and its relation with the feedback arc sets and tournaments (Q2446312):
Displaying 9 items.
- Combinatorics on update digraphs in Boolean networks (Q628333) (← links)
- Characterisation of the elementary cellular automata in terms of their maximum sensitivity to all possible asynchronous updates (Q1755339) (← links)
- Sequentialization and procedural complexity in automata networks (Q2055976) (← links)
- An asynchronous solution to the synchronisation problem for binary one-dimensional cellular automata (Q2077625) (← links)
- From multiple to single updates per cell in elementary cellular automata with neighbourhood based priority (Q2086703) (← links)
- \#P-completeness of counting update digraphs, cacti, and series-parallel decomposition method (Q2106620) (← links)
- Characterisation of the elementary cellular automata with neighbourhood priority based deterministic updates (Q2247031) (← links)
- About block-parallel Boolean networks: a position paper (Q6151154) (← links)
- Maximum sensitivity to update schedules of elementary cellular automata over periodic configurations (Q6151157) (← links)