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 order
of the complexity function (in rectangles)
for two-dimensional sequences
generated by a linear cellular automaton
with coefficients in $\mathbb{Z}/l \mathbb{Z}$, and polynomial initial condition.
We prove that the complexity function
is 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
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20161010045700950-0144:S0988375400001247:S0988375400001247_eqnU3.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20161010045700950-0144:S0988375400001247:S0988375400001247_eqnU3.gif?pub-status=live)
- 5
- Cited by