Block invariance and reversibility of one dimensional linear cellular automata (Q1738319)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7045557
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Block invariance and reversibility of one dimensional linear cellular automata |
scientific article; zbMATH DE number 7045557 |
Statements
Block invariance and reversibility of one dimensional linear cellular automata (English)
0 references
29 March 2019
0 references
A `block update' schedule for a cellular automaton on a finite space is a function that determines the order in which the nodes of the automaton are updated, and a cellular automaton is called invariant with respect to a collection of block updates if the set of periodic points for the automaton is independent of the block update schedule used. Here the property of reversibility is studied for cellular automata of radius 1 or 2, and related to block invariance questions, essentially via calculation and search.
0 references
cellular automata
0 references
linear cellular automata
0 references
block invariance
0 references
reversibility
0 references
0.8259846568107605
0 references
0.8179756999015808
0 references
0.8163963556289673
0 references
0.8068867921829224
0 references
