An example of degenerate hyperbolicity in a cellular automaton with 3 states
H Fukś, J Midgley-Volpato - arXiv preprint arXiv:1506.06649, 2015 - arxiv.org
We show that a behaviour analogous to degenerate hyperbolicity can occur in nearest-
neighbour cellular automata (CA) with three states. We construct a 3-state rule by" lifting" …
neighbour cellular automata (CA) with three states. We construct a 3-state rule by" lifting" …
Orbits of Bernoulli measures in cellular automata
H Fukś - arXiv preprint arXiv:2002.09079, 2020 - arxiv.org
We discuss how to construct shift-invariant probability measures over the space of
bisequences of symbols, and how to describe such measures in terms of block probabilities …
bisequences of symbols, and how to describe such measures in terms of block probabilities …
More Complex Rules
H Fukś - Solvable Cellular Automata: Methods and Applications, 2023 - Springer
More Complex Rules | SpringerLink Skip to main content Advertisement SpringerLink Account
Menu Find a journal Publish with us Track your research Search Cart Book cover Solvable …
Menu Find a journal Publish with us Track your research Search Cart Book cover Solvable …
An example of a deterministic cellular automaton exhibiting linear-exponential convergence to the steady state
H Fukś, J Midgley-Volpato - arXiv preprint arXiv:1704.00716, 2017 - arxiv.org
In a recent paper [arXiv: 1506.06649 [nlin. CG]], we presented an example of a 3-state
cellular automaton which exhibits behaviour analogous to degenerate hyperbolicity often …
cellular automaton which exhibits behaviour analogous to degenerate hyperbolicity often …
[PDF][PDF] Theory and applications of fully asynchronous cellular automata
B Sethi - 2018 - researchgate.net
This thesis studies the convergence and reversibility issues in asynchronous cellular
automata (ACAs). The ACAs, we consider here, are one-dimensional, twostate and three …
automata (ACAs). The ACAs, we consider here, are one-dimensional, twostate and three …
An example of computation of the density of ones in probabilistic cellular automata by direct recursion
H Fukś - … Cellular Automata: Theory, Applications and Future …, 2018 - Springer
We present a method for computing probability of occurrence of ones in a configuration
obtained by iteration of a probabilistic cellular automata (PCA), starting from a random initial …
obtained by iteration of a probabilistic cellular automata (PCA), starting from a random initial …