Article contents
Complexité et automates cellulaires linéaires
Published online by Cambridge University Press: 15 April 2002
Abstract
The aim of this paper is to evaluate the growth orderof the complexity function (in rectangles)for two-dimensional sequencesgenerated by a linear cellular automatonwith coefficients in $\mathbb{Z}/l \mathbb{Z}$ , and polynomial initial condition.We prove that the complexity functionis quadratic when l is a prime and that it increases with respect to the number of distinct prime factors of l.
- Type
- Research Article
- Information
- RAIRO - Theoretical Informatics and Applications , Volume 34 , Issue 5 , September 2000 , pp. 403 - 423
- Copyright
- © EDP Sciences, 2000
References
- 5
- Cited by