Reversible Cellular Automata

Reversible Cellular Automata is a type of cellular automaton in which the transition function is bijective, ensuring that every configuration has a unique predecessor, thereby allowing the system's evolution to be uniquely reversed in time.

141

Publications

5.8K

Citations

201

Authors

137

Institutions

Publications per year

2017–2026

42

Variants

Reversible Cellular Automaton

Authors

201

  1. KM
    Kenichi Morita

    Hiroshima University, Japan

    14 publications · 725 citations

    13

    h-index

  2. TP
    Tomaž Prosen

    University of Ljubljana, Slovenia

    7 publications · 263 citations

    7

    h-index

  3. İŞ
    İrfan Şiap

    Yıldız Technical University, Türkiye

    6 publications · 149 citations

    6

    h-index

  4. KI
    Katsunobu Imai

    Hiroshima University, Japan

    6 publications · 263 citations

    6

    h-index

  5. JC
    Jadav Chandra Das

    Maulana Abul Kalam Azad University of Technology, West Bengal, India

    6 publications · 155 citations

    6

    h-index

1–5 of 201

Venues

  1. Theoretical Computer Science

    11 publications · 486 citations

    11

    h-index

  2. Physica D Nonlinear Phenomena

    7 publications · 468 citations

    7

    h-index

  3. 4

    h-index

  4. arXiv (Cornell University)

    Repository · 4 publications · 62 citations

    4

    h-index

  5. International Journal of Theoretical Physics

    3 publications · 103 citations

    3

    h-index

1–5