Surjective cellular automata with zero entropy are almost one-to-one (Q634916): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.chaos.2011.01.013 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2017606799 / rank | |||
Normal rank | |||
Revision as of 22:33, 19 March 2024
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
cellular automata
0 references
almost one-to-one
0 references
entropy
0 references
uniform Bernoulli measure
0 references
