On the power of one-way communication
Journal of the ACM (JACM)
ACM SIGACT News
A brief history of cellular automata
ACM Computing Surveys (CSUR)
Constructible functions in cellular automata and their applications to hierarchy results
Theoretical Computer Science
Reconnaissance parallèle des langages rationnels sur automates cellulaires plans
Theoretical Computer Science
On interacting automata with limited nondeterminism
Fundamenta Informaticae - Special issue on cellular automata
Iterative Arrays with Small Time Bounds
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
On Time-Constructible Functions in One-Dimensional Cellular Automata
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Iterative Arrays with a Wee Bit Alternation
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Speeding-Up Cellular Automata by Alternations
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Space- and time-bounded nondeterminism for cellular automata
Fundamenta Informaticae - Special issue on cellular automata
Closure properties of cellular automata
Theoretical Computer Science
Low complexity classes of multidimensional cellular automata
Theoretical Computer Science
Simulation of one-way cellular automata by boolean circuits
Theoretical Computer Science
Space- and Time-Bounded Nondeterminism for Cellular Automata
Fundamenta Informaticae - Cellular Automata
On Interacting Automata with Limited Nondeterminism
Fundamenta Informaticae - Cellular Automata
Descriptional complexity of bounded context-free languages
Information and Computation
| Hi-index | 0.01 |