Journal article icon

Journal article

The impact of alphabet size on pattern complexity of maxmin-ω cellular automata

Abstract:
We present an analysis of an additive cellular automaton (CA) under asynchronous dynamics. The asynchronous scheme is maxmin-ω, a deterministic system, introduced in our previous work with a binary alphabet. Extending this work, we study the impact of a larger alphabet, which also allows a meaningful inference of the behaviour of the resultant CA from the asymptotic behaviour of the maxmin-ω update system. Far from being a straightforward positive correlation between complexity and alphabet size, we show that there is a region of ω and alphabet size where complexity of CA is maximal. Thus, despite employing a fixed CA rule, the complexity of this CA can be controlled by ω and alphabet size. The main message is that the effect of maxmin-ω updating on the state of a network can be well understood, especially if the state alphabet is counter-intuitively large.
Publication status:
Published
Peer review status:
Peer reviewed

Actions

Access Document

Files:
Publisher copy:
10.1007/s11047-020-09787-2

Authors

More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Mathematical Institute
Role:
Author
ORCID:
0000-0001-9473-6542


Publisher:
Springer
Journal:
Natural Computing More from this journal
Volume:
19
Pages:
273-285
Publication date:
2020-04-14
Acceptance date:
2020-04-14
DOI:
EISSN:
1572-9796
ISSN:
1567-7818


Language:
English
Keywords:
Pubs id:
1100342
Local pid:
pubs:1100342
Deposit date:
2020-04-15
ARK identifier:

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP