Elementary Cellular Automata

Elementary Cellular Automata is a one-dimensional cellular automaton, belonging to the broader class of cellular automata, distinguished by its binary state alphabet, nearest-neighbor coupling, and discrete synchronous update governed by a fixed rule set defined over all possible three-cell neighborhoods.

195

Publications

14K

Citations

373

Authors

221

Institutions

Publications per year

2017–2026

40

Authors

373

  1. GJ
    Genaro J. Martínez

    University of the West of England, United Kingdom

    10 publications · 251 citations

    10

    h-index

  2. AA
    Andrew Adamatzky

    University of the West of England, United Kingdom

    8 publications · 175 citations

    8

    h-index

  3. RA
    Ramón Alonso‐Sanz

    Universidad Politécnica de Madrid, Spain

    7 publications · 208 citations

    7

    h-index

  4. NF
    Nazim Fatès

    Institut national de recherche en sciences et technologies du numérique, France

    5 publications · 228 citations

    5

    h-index

  5. PH
    P.D. Hortensius

    IBM Research - Thomas J. Watson Research Center, United States

    4 publications · 350 citations

    4

    h-index

1–5 of 373

Venues

  1. Complex Systems

    12 publications · 989 citations

    10

    h-index

  2. Physica D Nonlinear Phenomena

    9 publications · 989 citations

    9

    h-index

  3. Theoretical Computer Science

    8 publications · 1K citations

    8

    h-index

  4. Complexity

    7 publications · 308 citations

    6

    h-index

  5. arXiv (Cornell University)

    Repository · 6 publications · 283 citations

    6

    h-index

1–5