Name
Abstract | ||
|---|---|---|
We investigate the dynamics of Elementary Cellular Automata (ECA) under fully asynchronous update with periodic boundary conditions. We tackle the reversibility issue, that is, we want to determine whether, starting from any initial condition, it is possible to go back to this initial condition with random updates. We present analytical tools that allow us to partition the ECA space into three classes: strongly irreversible, irreversible and recurrent. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/978-3-319-06089-7_4 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
asynchronous cellular automata,reversibility,recurrence,Markov chain modelling,classification | Discrete mathematics,Asynchronous communication,Elementary cellular automaton,Combinatorics,Computer science,Periodic boundary conditions,Initial value problem,Partition (number theory) | Conference |
Volume | ISSN | Citations |
8402 | 0302-9743 | 1 |
PageRank | References | Authors |
0.34 | 7 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Biswanath Sethi | 1 | 2 | 1.36 |
| Nazim Fatès | 2 | 212 | 25.31 |
| Sukanta Das | 3 | 100 | 25.66 |