Two-States Bilinear Intrinsically Universal Cellular Automata

Authors:
Nicolas Ollinger
Affiliations:
-
Venue:
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Year:
2001

Citing 1
Cited 2

Inducing an order on cellular automata by a grouping operation

Discrete Applied Mathematics

The Quest for Small Universal Cellular Automata

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Bulking II: Classifications of cellular automata

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Linear cellular automata have been studied in details using algebraic techniques [3]. The generalization to families of polynomial cellular automata seems natural. The following step of complexity consists of bilinear cellular automata which study has begun with the work of Bartlett and Garzon [2]. Thanks to bulking techniques [5], two-states bilinear intrinsically universal cellular automata are constructed. This result answers a question from Bartlett and Garzon [2] of 1995.