Surjective cellular automata with zero entropy are almost one-to-one (Q634916)

From MaRDI portal
Revision as of 21:48, 13 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q378477)
scientific article
Language Label Description Also known as
English
Surjective cellular automata with zero entropy are almost one-to-one
scientific article

    Statements

    Surjective cellular automata with zero entropy are almost one-to-one (English)
    0 references
    17 August 2011
    0 references
    The author shows that any one-dimensional surjective cellular automaton whose entropy is zero with respect to the uniform Bernoulli measure must be almost one-to-one.
    0 references
    0 references
    0 references
    cellular automata
    0 references
    almost one-to-one
    0 references
    entropy
    0 references
    uniform Bernoulli measure
    0 references