A brief history of cellular automata
ACM Computing Surveys (CSUR)
The Intrinsic Universality Problem of One-Dimensional Cellular Automata
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
On computing the entropy of cellular automata
Theoretical Computer Science
Cellular automata and communication complexity
Theoretical Computer Science - Discrete applied problems, florilegium for E. Goles
Theory of cellular automata: a survey
Theoretical Computer Science
Cell-centric heuristics for the classification of cellular automata
Parallel Computing
Two-by-Two Substitution Systems and the Undecidability of the Domino Problem
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Nilpotency and Limit Sets of Cellular Automata
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
The 4-way deterministic tiling problem is undecidable
Theoretical Computer Science
Sand automata as cellular automata
Theoretical Computer Science
On the undecidability of the limit behavior of Cellular Automata
Theoretical Computer Science
DLT'10 Proceedings of the 14th international conference on Developments in language theory
On factor universality in symbolic spaces
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Cellular Automata, Decidability and Phasespace
Fundamenta Informaticae - Non-Classical Models of Automata and Applications
Bulking II: Classifications of cellular automata
Theoretical Computer Science
On the complexity of limit sets of cellular automata associated with probability measures
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Densities and entropies in cellular automata
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Substitutions and strongly deterministic tilesets
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Computational aspects of cellular automata on countable sofic shifts
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
On the Undecidability of Attractor Properties for Cellular Automata
Fundamenta Informaticae - From Physics to Computer Science: to Gianpiero Cattaneo for his 70th birthday
From One-dimensional to Two-dimensional Cellular Automata
Fundamenta Informaticae - From Physics to Computer Science: to Gianpiero Cattaneo for his 70th birthday
Towards a rice theorem on traces of cellular automata
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Cellular automata between sofic tree shifts
Theoretical Computer Science
Local rule distributions, language complexity and non-uniform cellular automata
Theoretical Computer Science
| Hi-index | 0.01 |