On real-time cellular automata and trellis automata
Acta Informatica
A universal cellular automaton in quasi-linear time and its S—m—n form
Theoretical Computer Science
An introduction to symbolic dynamics and coding
An introduction to symbolic dynamics and coding
Inducing an order on cellular automata by a grouping operation
Discrete Applied Mathematics
Generation of Primes by a One-Dimensional Real-Time Iterative Array
Journal of the ACM (JACM)
Additive Cellular Automata over Zp and the Bottom of (CA,
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Universality in cellular automata
SWAT '70 Proceedings of the 11th Annual Symposium on Switching and Automata Theory (swat 1970)
Bulking II: Classifications of cellular automata
Theoretical Computer Science
Theoretical Computer Science
Bulking II: Classifications of cellular automata
Theoretical Computer Science
The two-handed tile assembly model is not intrinsically universal
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 5.23 |
This paper is the first part of a series of two papers dealing with bulking: a quasi-order on cellular automata comparing space-time diagrams up to some rescaling. Bulking is a generalization of grouping taking into account universality phenomena, giving rise to a maximal equivalence class. In the present paper, we discuss the proper components of grouping and study the most general extensions. We identify the most general space-time transforms and give an axiomatization of bulking quasi-order. Finally, we study some properties of intrinsically universal cellular automata obtained by comparing grouping to bulking.