The following pages link to Eric Goles (Q1825035):
Displaying 50 items.
- On conservative and monotone one-dimensional cellular automata and their particle representation (Q1884852) (← links)
- On limit cycles of monotone functions with symmetric connection graph (Q1885914) (← links)
- Dynamics of a class of ants on a one-dimensional lattice (Q1885916) (← links)
- Folding and tiling (Q1885917) (← links)
- Sandpile models and lattices: a comprehensive survey (Q1885925) (← links)
- The one-site distributions of Gibbs states on Bethe lattice are probability vectors of period \(\leq 2\) for a nonlinear transformation. (Q1963460) (← links)
- Self-organized societies: on the Sakoda model of social interactions (Q2012786) (← links)
- Freezing sandpiles and Boolean threshold networks: equivalence and complexity (Q2020018) (← links)
- On the complexity of asynchronous freezing cellular automata (Q2051787) (← links)
- On fungal automata (Q2086749) (← links)
- On the impact of treewidth in the computational complexity of freezing dynamics (Q2117789) (← links)
- On the complexity of generalized Q2R automaton (Q2134005) (← links)
- On the complexity of the stability problem of binary freezing totalistic cellular automata (Q2201794) (← links)
- The complexity of the asynchronous prediction of the majority automata (Q2201796) (← links)
- Shift-equivalence of \(k\)-ary, one-dimensional cellular automata rules (Q2207952) (← links)
- Computational universality of fungal sandpile automata (Q2213185) (← links)
- The complexity of the majority rule on planar graphs (Q2255002) (← links)
- On the complexity of two-dimensional signed majority cellular automata (Q2409572) (← links)
- (Q2762789) (← links)
- Block invariance in elementary cellular automata (Q2814755) (← links)
- Computational complexity of avalanches in the Kadanoff sandpile model (Q2883187) (← links)
- Dynamical Properties of An Automaton with Memory (Q2964414) (← links)
- Dynamical Behaviour of Neural Networks (Q3030624) (← links)
- (Q3031937) (← links)
- Lyapunov Functionals for Automata Networks Defined by Cyclically Monotone Functions (Q3348432) (← links)
- (Q3350809) (← links)
- (Q3358251) (← links)
- (Q3363205) (← links)
- (Q3450008) (← links)
- Understanding a Non-trivial Cellular Automaton by Finding Its Simplest Underlying Communication Protocol (Q3596753) (← links)
- (Q3733846) (← links)
- Invariants in automata networks (Q3773347) (← links)
- (Q3809292) (← links)
- (Q3811717) (← links)
- (Q3812320) (← links)
- (Q3815252) (← links)
- (Q3821596) (← links)
- (Q3823809) (← links)
- Comportement itératif des fonctions à multiseuil (Q3890589) (← links)
- (Q3934307) (← links)
- A short proof on the cyclic behaviour of multithreshold symmetric automata (Q3969869) (← links)
- The convergence of symmetric threshold automata (Q3969871) (← links)
- (Q3988479) (← links)
- Sand pile automata (Q3988646) (← links)
- (Q3995985) (← links)
- (Q4035337) (← links)
- Errata: Lyapunov Functionals for Automata Networks Defined by Cyclically Monotone Functions (Q4302275) (← links)
- (Q4310341) (← links)
- (Q4460871) (← links)
- SAND PILE AS A UNIVERSAL COMPUTER (Q4488258) (← links)
