We are improving our search experience. To check which content you have full access to, or for advanced search, go back to the old search.

Search

Please fill in this field.

Search Results

Showing 1-20 of 10,000 results
  1. On Linear Cellular Automata

    Abstract

    wolfram cellular automata are considered and their operation is demonstrated using an example of traffic flow simulation. For the class of...

    V. R. Kulikov, A. A. Kytmanov, ... D. P. Fedchenko in Programming and Computer Software
    Article 01 February 2024
  2. Associating parallel automata network dynamics and strictly one-way cellular automata

    We prove that the limit dynamics of any finite automata network under the parallel update schedule correspond exactly to the fixed points of a...

    Pacôme Perrotin in Natural Computing
    Article 09 June 2023
  3. Cellular Automata Technology Third Asian Symposium, ASCAT 2024, Durgapur, India, February 29–March 2, 2024, Revised Selected Papers

    This book constitutes the refereed conference proceedings of the Third Asian Symposium on Cellular Automata Technology, ASCAT 2024, held in Durgapur,...
    Mamata Dalui, Sukanta Das, Enrico Formenti in Communications in Computer and Information Science
    Conference proceedings 2024
  4. Wolfram’s cellular automata model for unhealthy gas leakage detection

    The Elementary Cellular Automata (ECA) introduced by Stephan Wolfram, is a powerful universal computing tool which can be explored for design...

    Sutapa Sarkar, Mourjya Chatterjee, ... Shuvendu Chakraborty in International Journal of Information Technology
    Article 16 May 2024
  5. Cellular Automata

    After a short introduction to cellular automata (CA), an information-theoretic analysis of one-dimensional CA is presented. It is based on a...
    Chapter 2024
  6. The Garden of Eden Theorem over Generalized Cellular Automata

    The Garden of Eden theorem is a fundamental result in the theory of cellular automata, which establishes a necessary and sufficient condition for the...

    Article 18 June 2024
  7. Mean dimension of continuous cellular automata

    We investigate the mean dimension of a cellular automaton (CA for short) with a compact non-discrete space of states. A formula for the mean...

    David Burguet, Ruxi Shi in Israel Journal of Mathematics
    Article 03 July 2023
  8. Synchronization of elementary cellular automata

    In this paper, we study how synchronization and state estimation are related in the context of elementary cellular automata. We first characterize...

    Théo Plénet, Franco Bagnoli, ... Laurent Lefèvre in Natural Computing
    Article 25 August 2023
  9. Solvable Cellular Automata Methods and Applications

    The main focus of the book is solvability of cellular automata, that is, expressing the state of a given cell after a given number of steps by an...
    Book 2023
  10. Linear Cellular Automata

    In this chapter we study linear cellular automata, namely cellular automata whose alphabet is a vector space and which are linear with respect to the...
    Tullio Ceccherini-Silberstein, Michel Coornaert in Cellular Automata and Groups
    Chapter 2023
  11. Cellular Automata

    This chapter introduces configuration spaces over general groups, their subshifts, and the cellular automata between them. Finiteness properties for...
    Tullio Ceccherini-Silberstein, Michel Coornaert in Exercises in Cellular Automata and Groups
    Chapter 2023
  12. Simulation of ideal material blocks using cellular automata

    We consider deterministic and probabilistic cellular automata to study and describe certain types of patterns in idealized material blocks. We have...

    C. Correia Ramos, Nada El Bouziani, ... Sara Fernandes in Nonlinear Dynamics
    Article 30 October 2023
  13. Cellular automata and Kan extensions

    In this paper, we formalize precisely the sense in which the application of a cellular automaton to partial configurations is a natural extension of...

    Alexandre Fernandez, Luidnel Maignan, Antoine Spicher in Natural Computing
    Article 27 January 2023
  14. Pseudo Random Number Generator Based on Cellular Automata with Self Organized Criticality

    In cryptography, pseudo-random numbers are crucial. The degree of strength of a cryptographic technique is directly influenced by the key’s...

    I. Gethzi Ahila Poornima, C. A. Yogaraja, ... B. Vijayalakshmi in SN Computer Science
    Article 20 April 2024
  15. Handling Sudoku puzzles with irregular learning cellular automata

    The use of Cellular Automata (CA) in combination with Learning Automata (LA) has demonstrated effectiveness in handling hard-to-be-solved problems....

    Theodoros Panagiotis Chatzinikolaou, Rafailia-Eleni Karamani, ... Georgios Ch. Sirakoulis in Natural Computing
    Article Open access 10 March 2024
  16. ReLiCADA: Reservoir Computing Using Linear Cellular Automata design algorithm

    In this paper, we present a novel algorithm to optimize the design of Reservoir Computing using Cellular Automata models for time series...

    Jonas Kantic, Fabian C. Legl, ... Jakob Hermann in Complex & Intelligent Systems
    Article Open access 13 February 2024
  17. Elementary cellular automata realized by stateful three-memristor logic operations

    Cellular automata (CA) are computational systems that exhibit complex global behavior arising from simple local rules, making them a fascinating...

    Hongzhe Wang, Junjie Wang, ... Yang Liu in Scientific Reports
    Article Open access 01 February 2024
  18. Distance-based affective states in cellular automata pedestrian simulation

    Cellular Automata have successfully been successfully applied to the modeling and simulation of pedestrian and crowd dynamics. In particular, the...

    Stefania Bandini, Daniela Briola, ... Giuseppe Vizzari in Natural Computing
    Article Open access 31 August 2023
  19. Photonic elementary cellular automata for simulation of complex phenomena

    Cellular automata are a class of computational models based on simple rules and algorithms that can simulate a wide range of complex phenomena....

    Gordon H. Y. Li, Christian R. Leefmans, ... Alireza Marandi in Light: Science & Applications
    Article Open access 30 May 2023
  20. Cellular automata and substitutions in topological spaces defined via edit distances

    The Besicovitch pseudometric is a shift-invariant pseudometric over the set of infinite sequences, that enjoys interesting properties and is suitable...

    Firas Ben Ramdhane, Pierre Guillon in Natural Computing
    Article 18 August 2023
Did you find what you were looking for? Share feedback.