The impact of alphabet size on pattern complexity of maxmin-ω cellular automata
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 meaningfu...
Huvudupphovsman: | Patel, EL |
---|---|
Materialtyp: | Journal article |
Språk: | English |
Publicerad: |
Springer
2020
|
Liknande verk
Liknande verk
-
Breaking the Legend: Maxmin Fairness notion is no longer effective
av: Miaji, Yaser, et al.
Publicerad: (2010) -
Computing team-maxmin equilibria in zero-sum multiplayer games
av: Zhang, Youzhi
Publicerad: (2020) -
Mechanism design with maxmin agents: Theory and an application to bilateral trade
av: Wolitzky, Alexander G.
Publicerad: (2017) -
Cellular Automata
av: Banks, Edwin Roger
Publicerad: (2004) -
Line complexity asymptotics of polynomial cellular automata
av: Stone, Bertrand, et al.
Publicerad: (2018)