in this paper an application of cellular learning automata (cla) to vlsi placement is presented. the cla, which is introduced for the first time in this paper, is different from standard cellular learning automata in two respects. it has input and the cell neighborhood varies during the operation of cla. the proposed cla based algorithm for vlsi placement is tested on number of placement proble...

Linear conjunctive grammars define the same family of languages as one-way real-time cellular automata (A. Okhotin, “On the equivalence of linear conjunctive grammars to trellis automata”, RAIRO ITA, 2004), and this family is known to be incomparable with the context-free languages (V. Terrier, “On real-time one-way cellular array”, Theoret. Comput. Sci., 1995). This paper demonstrates the cont...

the cellular automata method has been used to simulate the pattern formation of the schlögl model as a bistable reaction-diffusion system. both microscopic and macroscopic cellular automata approaches have been considered and two different methods for obtaining the probabilities in the microscopic approach have been mentioned. the results show the tendency of the system towards the more stable ...

introduction flood is an inevitable natural phenomenon occurring from time to time in all rivers and natural drainage systems, which not only damages the lives, natural resources and environment, but also causes the loss of economy and health. so estimation and prediction flood hazard is very important spatially in the watersheds without measurement station. there are many models in the water a...

In this paper, we study the quantitative behavior of one-dimensional linear cellular automata Tf [−r,r], defined by local rule f(x−r, . . . , xr) = r ∑ i=−r λixi (mod m), acting on the space of all doubly infinite sequences with values in a finite ring Zm, m ≥ 2. Once generalize the formulas given by Ban et al. [J. Cellular Automata 6 (2011) 385-397] for measure-theoretic entropy and topologica...

Linear acceleration theorems are known for most computational models. Although such results have been proved for two-dimensional cellular automata working on specific neighborhoods, no general construction was known. We present here a technique of linear acceleration for all twodimensional languages recognized by cellular automata working on complete neighborhoods. 1998 ACM Subject Classificati...

In this paper, we present the simulation of a simple, yet significantly powerful, sequential model by cellular automata. The simulated model is called oblivious multi-head one-way finite automata and is characterised by having its heads moving only forward, on a trajectory that only depends on the length of the input. While the original finite automaton works in linear time, its corresponding c...

A wide family of nonlinear sequence generators, the so-called clockcontrolled shrinking generators, has been analyzed and identified with a subset of linear cellular automata. The algorithm that converts the given generator into a linear model based on automata is very simple and can be applied in a range of practical interest. Due to the linearity of these automata as well as the characteristi...

A stack augmented generalization of cellular automata, the pushdown cellular automata, are investigated. We are studying the language accepting capabilities of such devices. Closure properties of real-time, linear-time and unrestricted time language families are shown. The relationships of these families with each other and to languages of sequential automata are considered.