Chaotic Behaviors of Symbolic Dynamics about Rule 58 in Cellular Automata

The complex dynamical behaviors of rule 58 in cellular automata are investigated from the viewpoint of symbolic dynamics.The rule is Bernoulli σ τ -shift rule, which is members of Wolfram’s class II, and it was said to be simple as periodic before. It is worthwhile to study dynamical behaviors of rule 58 and whether it possesses chaotic attractors or not. It is shown that there exist two Bernoullimeasure attractors of rule 58. The dynamical properties of topological entropy and topological mixing of rule 58 are exploited on these two subsystems. According to corresponding strongly connected graph of transition matrices of determinative block systems, we divide determinative block systems into two subsets. In addition, it is shown that rule 58 possesses rich and complicated dynamical behaviors in the space of bi-infinite sequences. Furthermore, we prove that four rules of global equivalence class ε3 4 of CA are topologically conjugate. We use diagrams to explain the attractors of rule 58, where characteristic function is used to describe that some points fall into Bernoulli-shiftmap after several times iterations, andwe find that these attractors are not global attractors. The Lameray diagram is used to show clearly the iterative process of an attractor.


Introduction
Cellular automaton (CA) was first introduced in 1951 [1].CA is a mathematical model consisting of large numbers of simple identical components with local interactions [2].The simple components act together to produce complex global behavior.CA performs complex computation with high degree of efficiency and robustness.Three major factors have resulted in the revival of interest in the behavior of cellular systems [3].First, the development of powerful computers and microprocessors has made the rapid simulation of CA possible.Second, the use of CA to simulate physical systems has attracted much interest in the scientific community.Third, the advent of VLSI as an implementation medium has focused attention on the communication requirements of successful hardware algorithms.In recent years, many applications of CA have been reported, especially in cryptography [4][5][6][7][8][9], image processing [10,11], and associative memory [12,13].
In recent years, many researches were devoted to find properties of rules of CA, especially binary one-dimensional CA.Because the rules of binary one-dimensional CA are simple to study, the evolutions of these rules can be reflected directly by image.In 1980s, Wolfram proposed CA as models for physical systems which exhibit complex or even chaotic behaviors based on empirical observations, and he divided the 256 ECA (binary one-dimensional CA with radius 1) rules informally into four classes using dynamical concepts like periodicity, stability, and chaos [14][15][16].Recently, [17][18][19][20][21][22] focused on ECA in detail.In [17], Chua et al. listed 256 Boolean function "cubes" defining all Boolean functions of three binary variables, and they elucidated that every binary cellular automata of any spatial dimension was a special case of a cellular automaton with the same neighborhood size.In [18], Chua et al. partitioned the entire set of 256 local rules into 16 different gene families.Chua et al. [19] mentioned that each rule has three globally equivalent local rules determined by three corresponding global transformations, namely, leftright transformation  † , global complementation , and left-right complementation  * .Each equivalence class is identified by    , where  is complexity index and  is index of th class.In [20], the authors presented that 112 rules of 256 local rules were Bernoulli   -shift rules.Each of the 112 Bernoulli   -shift rules has an ID code   [, , ], where  denotes the number of attractors of rule ,  denotes the slope of the Bernoulli   -shift map, and  denotes the relevant forward time-.Hence, the space-time evolution of any one of the 112 rules on their attractors can be uniquely predicted by two parameters:  = ±2  and .For example, rule 58 has two attractors ( = 2,  = 1,  = 1) and ( = 1/2,  = −1,  = 2).Wolfram considered that Bernoulli   -shift rules were simple as periodic, but he did not find other complex dynamical behaviors.Recently, some authors [23][24][25][26][27][28] found that some rules of Bernoulli   -shift rules are chaotic in the sense of both Li-York and Devaney.However, they did not involve and studied the dynamical behavior of rule 58.For 256 rules, every rule has its properties which are different from other rules.So, we need to study these special properties for every rule for practical application.
In this paper, the complex dynamical behavior of rule 58 in cellular automata is studied in detail.It will be shown that rule 58 with bi-infinite bit strings possesses rich and complicated dynamical behaviors.The rest of the paper is organized as follows.In Section 2, the basic concepts of onedimension CA (1DCA) and symbolic dynamics are introduced.The Boolean functions of rule 58 are also presented, and expressions of two attractors are given.In Section 3, two subsystems of rule 58 are characterized.We prove that rule 58 is topologically mixing and chaotic in the sense of Li-York and Devaney on the Λ  58 1 and Λ 58 2 , respectively.We also prove that four rules of global equivalence class  3  4 of CA are topologically conjugate.In Section 4, characteristic function is used to describe that all points of rule 58 fall into Bernoulli-shift map after several times iterations, and the Lameray diagram is used to show clearly the iterative process of an attractor.We mention that rule 58 can be used in associative memory.Section 5 presents some conclusions.

Dynamical Behaviors of 𝑓 58 on Two Subsystems
In this section, dynamical behaviors of  58 will be researched.We find that rule 58 is chaotic in the sense of Li-York and Devaney on its two subsystems.
The explicit proof of this proposition is presented in the Appendix.
The dynamical behaviors of  58 () on the set Λ 58 1 are shown as follows.
Definition 3 (see [31]).A square {0, 1} matrix  is irreducible, if for every pair of indices  and  there is an  such that    > 0.
A square {0, 1} matrix corresponds to a directed graph.The vertices of the graph are the indices for the rows and columns of .There is an edge from vertex  to vertex  if   = 1.A square {0, 1} matrix is irreducible if and only if the corresponding graph is strongly connected.If Λ  is a twoorder subshift of finite type, then it is topologically mixing if and only if  is irreducible and aperiodic [31].
We give corresponding graph  1 58 of the matrix  58 1 in Figure 1.We find that  1 58 is not a strongly connected graph.Therefore,  58 | Λ 58 1 is not topologically mixing.But the subgraphs  0 and  1 ,  2 ,  3 , and  4 are strongly connected graph, respectively.So, we can divide  58  1 into two subsets: , where Based on the above definition and analysis, we give the following results.
Then, the proof is similar to proof of necessity and sufficiency in Proposition 1, so the details are omitted.
Next, we will discuss the relationship on four rules of global equivalence class  3  4 .
Remark 21.  58 ,  114 ,  163 , and  177 are topologically conjugate, respectively.Therefore, if we know that one of four rules is chaotic in the sense of both Li-Yorke and Devaney in its attractors, we can deem that others of four rules are chaotic in the sense of both Li-Yorke and Devaney in their attractors, respectively.The phenomenon also presents that the global equivalence class introduced by Chua et al. [22] is useful and important for research of rule of cellular automata.

Using Diagrams to Explain Attractors of Four Rules
From a definition on global characteristic function in [20], the Boolean string  can be associated with a real number where  = ∑  =0 2 −(+1)   is the decimal form of Boolean string  = [ 0  1 . . . −1   ].The CAs' characteristic function   of rule  is defined as that is, where  denotes rational numbers.Let  = 13.Figure 3 shows characteristic functions of rule 58. Figure 3(a) describes that some points of rule 58 fall into Bernoulli-shift map after twenty-six iterations, respectively, where  = 1. Figure 3(b) describe that some points of four rules fall into Bernoulli-shift map after twenty-seven iterations, respectively, where  = 2.
If we choose different values of  for the four rules, we can get different initial binary configuration for the evolution of four rules.The different initial binary configuration may lead to different attractor periods.If the value of  is fixed, we find that the attractor period may be different.Let  = 5; then we can obtain Figure 4, which shows some attractors of rule 58.Figures 4(a) and 4(b) show that the period of attractor is 1, and the attractor belongs to Λ ℎ 58 1 and Λ 58 2 ; Figure 4(c) shows that the period of attractor is 2, and the attractor belongs to Λ  58 1 ; Figure 4(d) shows that the attractor belongs to both Λ  58  1 and Λ 58 2 , where the solid lines represent that the attractor belongs to Λ  58  1 and the dotted lines represent that the attractor belongs to Λ 58 2 .Let  = 4; then we can obtain Mathematical Problems in Engineering Figure 5, where the solid lines stand for the real evolution of binary configuration 11100, and the dotted lines stand for the attractor belonging to Λ 58 2 .Next, we use the Lameray diagram [33] to present our attractors.The diagrams show clearly the iterative process of attractors.In terms of the attractor of Figure 4(d), we get that the values of characteristic function of the attractor are 0.7031, 0.4219, and 0.8438, respectively.Figure 6(a) shows the iterative process of an attractor, where  = 1, and Figure 6(b) shows the iterative process of an attractor, where  = 2.Then, we can associate the period-3 attractor of rule 58 in Figure 6(a) as a period-3 point of a continuous map  : [0, 1] → [0, 1] which we know that it is chaotic because "period-3 implies chaos" [34].We can also consider Figure 6(b) by the above method.Chaos implies that rules 58 have infinite period orbits on its subsystems.
In recent years, associative memory was researched in many papers [12,13].It is obvious that rule 58 can be used in associative memory.By strongly connected graph of rule 58, we can know the elements on its attractors.Then, we can choose a bit string which belongs to an attractor as memory pattern.Since there are infinite orbits, the storage capability is very large.For example, we can choose 010101 as a memory pattern in Figure 4(c).The associative memory model provides a solution to problem where time to recognize a pattern is independent of the number of patterns stored.

Conclusions
In this paper, the dynamical behaviors of rule 58 in cellular automata, which is Bernoulli   -shift rule, are carefully investigated from viewpoint of symbolic dynamics.We derive the conditions according to Bernoulli   -shift evolution for rule 58.Then, in terms of the transition matrices of determinative block systems of subsystems of rule 58, we obtain the values of topological entropy of subsystems.According to corresponding strongly connected graph of transition matrices of determinative block systems of subsystems Λ 58 1 , we divide determinative block systems into two subsets.Then, we find that rule 58 is topologically mixing on Λ  58 1 .Furthermore, we find that  58 | Λ 58 2 is topologically mixing.So, rule 58 is chaotic in the sense of both Li-Yorke and Devaney.Then, we prove that four rules belonging to global equivalence class  3  4 of CA are topologically conjugate.We use diagrams to explain the attractors of rule 58, where characteristic function and the Lameray diagram are used to describe that some points fall into Bernoulli-shift map after several times iterations and to show clearly the iterative process of an attractor, respectively.

Figure 5 :Figure 6 :
Figure 5: Period-5 isle of Eden is shown, where  = 4, and the white lattice stands for 0 and black for 1.

(
CK2013B15), in part by Scientific and Technological Research Program of Chongqing Municipal Education Commission (Grants nos.KJ131401 and KJ131416), in part by Natural Science Foundation Project of CQ CSTC (Grants nos.cstc2012jjB0095 and cstc2012jjA1459), in part by the National Natural Science Foundation of China (51275547), in part by Achievement Transfer Program of Institutions of Higher Education in Chongqing (KJ121413), and in part by Teaching & Research Program of Chongqing University of Science and Technology (X2012-29-S).

Table 1 :
The truth table of Boolean function of rules 58.

Table 2 :
The iterative process of bit string  1 .
⋅  58 is chaotic in the sense of both Li-Yorke and Devaney on Λ 58 2 .