
Accepted Papers (Full)
On Derivatives and Subpattern Orders of Countable Subshifts
Boolean networks synchronism sensitivity and XOR circulant networks convergence time
Topology Inspired Problems for Cellular Automata, and a Counterexample in Topology
Fixed Parameter Undecidability for Wang Tilesets
On Nilpotency and Asymptotic Nilpotency of Cellular Automata
Entry times in automata with simple defect dynamics
On the Parity Problem in One-Dimensional Cellular Automata
Topological arguments for Kolmogorov complexity.
Local Rules for Computable Planar Tilings
Universality of one-dimensional reversible and number-conserving cellular automata
A Simple Optimum-Time FSSP Algorithm for Multi-Dimensional Cellular Automata
Computing by Temporal Order: Asynchronous Cellular Automata
Linear functional classes over cellular automata
Transductions Computed by One-Dimensional Cellular Automata
Intrinsic Simulations between Stochastic Cellular Automata
Strictly Periodic Points in Cellular Automata
Phase Space Invertible Asynchronous Cellular Automata
Topological properties of cellular automata on trees
A Universal Semi-totalistic Cellular Automaton on Kite and Dart Penrose Tilings
Accepted Papers (Exploratory)
(Intrinsically?) Universal Asynchronous Cellular Automata II
Spectral similarity among elementary cellular automata
Synchronous Cellular Automata-Based Scheduler with Construction Heuristic to Static Task Scheduling in Multiprocessors
A necessary condition for boundary sensitivity of attractive non-linear stochastic cellular automata in Z2
Information Dynamics of Cellular Automata II --- A Probabilistic Study
A note on the density classification problem in two dimensions
Unclassified cellular automata
Cellular automata showing coexistence of dynamics
The packing problem : A divide and conquer algorithm on cellular automata
Local periodicity and μ-equicontinuity in cellular automata
Solving the Parity Problem with Elementary Cellular Automaton Rule 60
Characterization of non-uniform cellular automata having only two point states 0n and 1n
Refining cellular automata with routing constraints
Site info
© 2011-2012 Automata 2012 | Generated by webgen | Design by A. Viklund.