On the convergence of elementary cellular automata under sequential update modes

Cites work

A fast algorithm to generate necklaces with fixed content
A guided tour of asynchronous cellular automata
A logical calculus of the ideas immanent in nervous activity
A one-dimensional physically universal cellular automaton
A sequential solution to the density classification task using an intermediate alphabet
A six-state minimal time solution to the Firing squad synchronization problem
About block-parallel Boolean networks: a position paper
An experimental study of robustness to asynchronism for elementary cellular automata
Cell space approaches in biomathematics
Combinatorics on update digraphs in Boolean networks
Complexity of reachability problems for finite discrete dynamical systems
Convergence of asynchronous cellular automata: does size matter?
Dynamic models of segregation†
Fully asynchronous behavior of double-quiescent elementary cellular automata
scientific article; zbMATH DE number 4195206 (Why is no real title available?)
scientific article; zbMATH DE number 3896307 (Why is no real title available?)
scientific article; zbMATH DE number 3898247 (Why is no real title available?)
scientific article; zbMATH DE number 3898249 (Why is no real title available?)
scientific article; zbMATH DE number 4042465 (Why is no real title available?)
Intrinsic universality in automata networks. III: On symmetry versus asynchrony
Maximum sensitivity to update schedules of elementary cellular automata over periodic configurations
Modeling epidemics using cellular automata
Non-maximal sensitivity to synchronism in elementary cellular automata: exact asymptotic measures
On the complexity of asynchronous freezing cellular automata
On the convergence of Boolean automata networks without negative cycles
On the reversibility of ECAs with fully asynchronous updating: the recurrence point of view
PSPACE-completeness of majority automata networks
Real-time language recognition by one-dimensional cellular automata
Reversibility of elementary cellular automata under fully asynchronous update
Reversibility of elementary cellular automata with fully asynchronous updating: an analysis of the rules with partial recurrence
Statistical mechanics of cellular automata
Theory of self-reproducing automata. Edited and completed by Arthur W. Burks
Turning block-sequential automata networks into smaller parallel networks with isomorphic limit dynamics

This page was built for publication: On the convergence of elementary cellular automata under sequential update modes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7396360)