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
Parents
141
1–5 of 141
201
13
h-index
7
h-index
6
h-index
6
h-index
Maulana Abul Kalam Azad University of Technology, West Bengal, India
6 publications · 155 citations
6
h-index
1–5 of 201
137

Hiroshima University
Hiroshima, Japan
10 h-index
16 publications
768 citations

University of Ljubljana
Ljubljana, Slovenia
9 h-index
17 publications
545 citations

Maulana Abul Kalam Azad University of Technology, West Bengal
Kolkata, India
7 h-index
15 publications
434 citations

University of Turku
Turku, Finland
6 h-index
6 publications
527 citations

Yıldız Technical University
Istanbul, Türkiye
6 h-index
8 publications
175 citations
Islamic Azad University of Tabriz
Tabriz, Iran
6 h-index
10 publications
343 citations

Centre National de la Recherche Scientifique
Paris, France
4 h-index
6 publications
120 citations
Harran University
Sanliurfa, Türkiye
4 h-index
5 publications
116 citations
1–8 of 137
11 publications · 486 citations
11
h-index
7 publications · 468 citations
7
h-index
5 publications · 165 citations
4
h-index
Repository · 4 publications · 62 citations
4
h-index
3 publications · 103 citations
3
h-index
1–5