Graph-theoretical characterization of invertible cellular automata (Q1581757)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graph-theoretical characterization of invertible cellular automata |
scientific article |
Statements
Graph-theoretical characterization of invertible cellular automata (English)
0 references
8 October 2000
0 references
The paper considers invertible cellular automata (which are described by induced surjective global rule on the set of finite configurations). Invertibility is characterized by graph-theoretical conditions. This allows construction of complete families of various invertible automata, viewed as discrete dynamical systems.
0 references
invertible cellular automata
0 references
0 references
0 references
0 references
