Surjective cellular automata with zero entropy are almost one-to-one
Surjective cellular automata with zero entropy are almost one-to-one
| dc.contributor.author | Moothathu, T. K.S. | |
| dc.date.accessioned | 2022-03-27T04:08:10Z | |
| dc.date.available | 2022-03-27T04:08:10Z | |
| dc.date.issued | 2011-01-01 | |
| dc.description.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. | |
| dc.identifier.citation | Chaos, Solitons and Fractals. v.44(6) | |
| dc.identifier.issn | 09600779 | |
| dc.identifier.uri | 10.1016/j.chaos.2011.01.013 | |
| dc.identifier.uri | https://www.sciencedirect.com/science/article/abs/pii/S0960077911000440 | |
| dc.identifier.uri | https://dspace.uohyd.ac.in/handle/1/6363 | |
| dc.title | Surjective cellular automata with zero entropy are almost one-to-one | |
| dc.type | Journal. Article | |
| dspace.entity.type |
Files
License bundle
1 - 1 of 1