Surjective cellular automata with zero entropy are almost one-to-one
Surjective cellular automata with zero entropy are almost one-to-one
No Thumbnail Available
Date
2011-01-01
Authors
Moothathu, T. K.S.
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
We show that any one-dimensional surjective cellular automata whose entropy is zero with respect to the uniform Bernoulli measure must be almost one-to-one. © 2011 Elsevier Ltd. All rights reserved.
Description
Keywords
Citation
Chaos, Solitons and Fractals. v.44(6)