In this paper we study the topological and metric directional entropy of -actions by generated additive cellular automata (CA hereafter), defined by a local rule , , , i.e. the maps which are given by , $y_{n} = f(x_{n+l}, …, x_{n+r}) = \sum_{i=l}^r\lambda_{i}x_{i+n}(mod m)x=(x_n)_ {n=-\infty}^{\infty}\in ^{m}f: {m}^{r-l+1}\to {m}m (m \geq 2)^{m}m$ is a positive integer. Our main aim is to give an algorithm for computing the topological directional entropy of the -actions generated by the additive CA and the shift map. Thus, we ask to give a closed formula for the topological directional entropy of -action generated by the pair $(T{f[l, r]}, \sigma)\theta$ that can be efficiently and rightly computed by means of the coefficients of the local rule f as similar to [Theor. Comput. Sci. 290 (2003) 1629-1646]. We generalize the results obtained by Ak\i n [The topological entropy of invertible cellular automata, J. Comput. Appl. Math. 213 (2) (2008) 501-508] to the topological entropy of any invertible linear CA.

生成讲解博客的中文版本

生成AI智能校验的中文版本