Do you want to publish a course? Click here

Structure of Rule Table and Phase Diagram of One Dimensional Cellular Automata

69   0   0.0 ( 0 )
 Added by Sunao Sakai
 Publication date 2002
  fields Physics
and research's language is English




Ask ChatGPT about the research

In addition to the $lambda$ parameter, we have found another parameter which characterize the class III, class II and class IV patterns more quantitatively. It explains why the different classes of patterns coexist at the same $lambda$. With this parameter, the phase diagram for an one dimensional cellular automata is obtained. Our result explains why the edge of chaos(class IV) is scattered rather wide range in $lambda$ around 0.5, and presents an effective way to control the pattern classes. oindent PACS: 89.75.-k Complex Systems



rate research

Read More

It is shown that for the N-neighbor and K-state cellular automata, the class II, class III and class IV patterns coexist at least in the range $frac{1}{K} le lambda le 1-frac{1}{K} $. The mechanism which determines the difference between the pattern classes at a fixed $lambda$ is found, and it is studied quantitatively by introducing a new parameter $F$. Using the parameter F and $lambda$, the phase diagram of cellular automata is obtained for 5-neighbor and 4-state cellular automata. PACS: 89.75.-k Complex Systems
The mechanism which discriminates the pattern classes at the same $lambda$, is found. It is closely related to the structure of the rule table and expressed by the numbers of the rules which break the strings of the quiescent states. It is shown that for the N-neighbor and K-state cellular automata, the class I, class II, class III and class IV patterns coexist at least in the range, $frac{1}{K} le lambda le 1-frac{1}{K} $. The mechanism is studied quantitatively by introducing a new parameter $F$, which we call quiescent string dominance parameter. It is taken to be orthogonal to $lambda$. Using the parameter F and $lambda$, the rule tables of one dimensional 5-neighbor and 4-state cellular automata are classified. The distribution of the four pattern classes in ($lambda$,F) plane shows that the rule tables of class III pattern class are distributed in larger $F$ region, while those of class II and class I pattern classes are found in the smaller $F$ region and the class IV behaviors are observed in the overlap region between them. These distributions are almost independent of $lambda$ at least in the range $0.25 leq lambda leq 0.75$, namely the overlapping region in $F$, where the class III and class II patterns coexist, has quite gentle $lambda$ dependence in this $lambda$ region. Therefore the relation between the pattern classes and the $lambda$ parameter is not observed. PACS: 89.75.-k Complex Systems
Cellular Automaton (CA) and an Integral Value Transformation (IVT) are two well established mathematical models which evolve in discrete time steps. Theoretically, studies on CA suggest that CA is capable of producing a great variety of evolution patterns. However computation of non-linear CA or higher dimensional CA maybe complex, whereas IVTs can be manipulated easily. The main purpose of this paper is to study the link between a transition function of a one-dimensional CA and IVTs. Mathematically, we have also established the algebraic structures of a set of transition functions of a one-dimensional CA as well as that of a set of IVTs using binary operations. Also DNA sequence evolution has been modelled using IVTs.
This paper proposes several algorithms and their Cellular Automata Machine (CAM) for drawing the State Transition Diagram (STD) of an arbitrary Cellular Automata (CA) Rule (any neighborhood, uniform/ hybrid and null/ periodic boundary) and length of the CA n. It also discusses the novelty, hardware cost and the complexities of these algorithms.
In this paper, we explore the two-dimensional behavior of cellular automata with shuffle updates. As a test case, we consider the evacuation of a square room by pedestrians modeled by a cellular automaton model with a static floor field. Shuffle updates are characterized by a variable associated to each particle and called phase, that can be interpreted as the phase in the step cycle in the frame of pedestrian flows. Here we also introduce a dynamics for these phases, in order to modify the properties of the model. We investigate in particular the crossover between low- and high-density regimes that occurs when the density of pedestrians increases, the dependency of the outflow in the strength of the floor field, and the shape of the queue in front of the exit. Eventually we discuss the relevance of these results for pedestrians.
comments
Fetching comments Fetching comments
Sign in to be able to follow your search criteria
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا