Graph-theoretical characterization of invertible cellular automata (Q1581757)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Graph-theoretical characterization of invertible cellular automata |
scientific article; zbMATH DE number 1514729
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graph-theoretical characterization of invertible cellular automata |
scientific article; zbMATH DE number 1514729 |
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
