13,091 research outputs found

    Celulární automat a CML systémy

    Get PDF
    The main aim of this thesis is the study of cellular automata and discrete dynamical systems on a lattice. Both tools, cellular automata as well as dynamical systems on a lattice are introduced and elementary properties described. The relation between cellular automata and dynamical system on lattice is derived. The main goal of the thesis is also the use of the cellular automata as that mathematical tool of evolution visualization of discrete dynamical systems. The theory of cellular automata is applied to the discrete dynamical systems on a lattice Laplacian type and implemented in Java language.Hlavním cílem práce je studium vztahu celulárních automatů a diskrétních dynamických systémů na mřížce. Oba nástroje, jak celulární automat tak dynamický systém na mřížce, jsou zavedeny a jejich základní vlastnosti popsány. Vztah mezi celulárními automaty a dynamickými systémy na mřížce je podrobně popsán. Hlavním cílem práce je dále použití nástroje celulárního automatu jako matematického vizualizačního prostředku evoluce diskrétních dynamických systémů. Teorie celulárních automatů je použita na dynamické systémy na mřížce Lamplaceova typu a implementována v prostředí Java.470 - Katedra aplikované matematikyvelmi dobř

    An Experimental Study of Robustness to Asynchronism for Elementary Cellular Automata

    Get PDF
    Cellular Automata (CA) are a class of discrete dynamical systems that have been widely used to model complex systems in which the dynamics is specified at local cell-scale. Classically, CA are run on a regular lattice and with perfect synchronicity. However, these two assumptions have little chance to truthfully represent what happens at the microscopic scale for physical, biological or social systems. One may thus wonder whether CA do keep their behavior when submitted to small perturbations of synchronicity. This work focuses on the study of one-dimensional (1D) asynchronous CA with two states and nearest-neighbors. We define what we mean by ``the behavior of CA is robust to asynchronism'' using a statistical approach with macroscopic parameters. and we present an experimental protocol aimed at finding which are the robust 1D elementary CA. To conclude, we examine how the results exposed can be used as a guideline for the research of suitable models according to robustness criteria.Comment: Version : Feb 13th, 2004, submitted to Complex System
    corecore