English
Related papers

Related papers: Pattern formation of generalized fuzzy elementary …

200 papers

We say that a Cellular Automata (CA) is coalescing when its execution on two distinct (random) initial configurations in the same asynchronous mode (the same cells are updated in each configuration at each time step) makes both…

Cellular Automata and Lattice Gases · Physics 2007-12-13 Jean-Baptiste Rouquier , Michel Morvan

Predicting the time to build software is a very complex task for software engineering managers. There are complex factors that can directly interfere with the productivity of the development team. Factors directly related to the complexity…

A novel procedure to perform fuzzy clustering of multivariate time series generated from different dependence models is proposed. Different amounts of dissimilarity between the generating models or changes on the dynamic behaviours over…

Methodology · Statistics 2021-09-09 Ángel López-Oriona , José A. Vilar , Pierpaolo-D'Urso

In this paper I describe a cellular automaton model of a multi-species ecosystem, suitable for the study of emergent properties of macroevolution. Unlike majority of ecological models, the number of coexisting species is not fixed. Starting…

Populations and Evolution · Quantitative Biology 2009-09-23 Wojciech Borkowski

We show that a large number of elementary cellular automata are computationally simple. This work is the first systematic classification of elementary cellular automata based on a formal notion of computational complexity. Thanks to the…

Computational Complexity · Computer Science 2014-06-23 Pierre-Étienne Meunier

This paper proposes a new fuzzy assessing procedure with application in management decision making. The proposed fuzzy approach build the membership functions for system characteristics of a standby repairable system. This method is used to…

Artificial Intelligence · Computer Science 2017-07-07 Shoele Jamali , Mehrdad J. Bani

Flexible Time is a new formalism for calculations about one-dimensional cellular automata. It unifies the states of a finite number of cells into a single object, even if they occur at different times. This gives greater flexibility to…

Cellular Automata and Lattice Gases · Physics 2014-03-04 Markus Redeker

Cellular automata are widely used to model natural or artificial systems. Classically they are run with perfect synchrony, i.e., the local rule is applied to each cell at each time step. A possible modification of the updating scheme…

Cellular Automata and Lattice Gases · Physics 2008-02-13 Nazim A. Fatès

In this paper I present a first attempt for a possible description of fluids dynamics by mean of a cellular automata technique. With the use of simple and elementary rules, based on random behaviour either, the model permits to obtain the…

Computational Complexity · Computer Science 2007-05-23 Gianluca Argentini

A fuzzer provides randomly generated inputs to a targeted software to expose erroneous behavior. To efficiently detect defects, generated inputs should conform to the structure of the input format and thus, grammars can be used to generate…

Software Engineering · Computer Science 2020-08-05 Martin Eberlein , Yannic Noller , Thomas Vogel , Lars Grunske

The searching for the stable patterns in the evolution of cellular automata is implemented using stochastic synchronization between the present structures of the system and its precedent configurations. For most of the known evolution rules…

Cellular Automata and Lattice Gases · Physics 2007-05-23 J. R. Sanchez , R. Lopez-Ruiz

One of the most important problems in contemporary science, and especially in biology, is to reveal mechanisms of pattern formation. On the level of biological tissues, patterns form due to interactions between cells. These interactions can…

Cellular Automata and Lattice Gases · Physics 2020-07-23 Manan'Iarivo Rasolonjanahary , Bakhtier Vasiev

In this paper we present two interesting properties of stochastic cellular automata that can be helpful in analyzing the dynamical behavior of such automata. The first property allows for calculating cell-wise probability distributions over…

Formal Languages and Automata Theory · Computer Science 2015-08-20 Witold Bołt , Jan M. Baetens , Bernard DeBaets

The subject of this paper is the evolution of the concept of information processing in regular structures based on multi-level processing in nested cellular automata. The essence of the proposed model is a discrete space-time containing…

Neural and Evolutionary Computing · Computer Science 2022-10-13 Jerzy Szynka

Determinization of fuzzy finite automata is understood here as a procedure of their conversion into equivalent crisp-deterministic fuzzy automata, which can be viewed as being deterministic with possibly infinitely many states, but with…

Formal Languages and Automata Theory · Computer Science 2014-12-17 Ivana Micić , Zorana Jančić , Jelena Ignjatović , Miroslav Ćirić

Complexity has been a recurrent research topic in cellular automata because they represent systems where complex behaviors emerge from simple local interactions. A significant amount of previous research has been conducted proposing…

Modelling of complex systems is mainly based on the decomposition of these systems in autonomous elements, and the identification and definitio9n of possible interactions between these elements. For this, the agent-based approach is a…

Artificial Intelligence · Computer Science 2013-02-27 Alain-Jérôme Fougères

Cellular Automata have been used since their introduction as a discrete tool of modelization. In many of the physical processes one may modelize thus (such as bootstrap percolation, forest fire or epidemic propagation models, life without…

Computational Complexity · Computer Science 2018-05-02 Florent Becker , Diego Maldonado , Nicolas Ollinger , Guillaume Theyssier

We rigorously prove a form of disorder-resistance for a class of one-dimensional cellular automaton rules, including some that arise as boundary dynamics of two-dimensional solidification rules. Specifically, when started from a random…

Probability · Mathematics 2015-09-30 Janko Gravner , Alexander E. Holroyd

We propose a characteristic representation ofone-dimensional and 2-state, 3-neighbor cellular automaton rules, which describes an effective form of each rule after many time steps. Simulated results of the representation show that complex…

chao-dyn · Physics 2008-02-03 Y. Kayama , H. Anada , Y. Imamura , 9 pages