Block invariance and reversibility of one dimensional linear cellular automata (Q1738319)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Block invariance and reversibility of one dimensional linear cellular automata
scientific article

    Statements

    Block invariance and reversibility of one dimensional linear cellular automata (English)
    0 references
    0 references
    0 references
    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

    Identifiers