Line complexity asymptotics of polynomial cellular automata
Cellular automata are discrete dynamical systems that consist of patterns of symbols on a grid, which change according to a locally determined transition rule. In this paper, we will consider cellular automata that arise from polynomial transition rules, where the symbols are integers modulo some pr...
| Main Authors: | , |
|---|---|
| Other Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Springer US,
2018-11-20T14:59:58Z.
|
| Subjects: | |
| Online Access: | Get fulltext |