The following pages link to Benjamin Hellouin de Menibus (Q1693997):
Displaying 13 items.
- Characterisation of limit measures of higher-dimensional cellular automata (Q1693998) (← links)
- Effect of quantified irreducibility on the computability of subshift entropy (Q1737069) (← links)
- Necessary conditions for tiling finitely generated amenable groups (Q1988316) (← links)
- Asymptotic behaviour of the one-dimensional ``rock-paper-scissors'' cyclic cellular automaton (Q2240889) (← links)
- Self-organisation in cellular automata with coalescent particles: qualitative and quantitative approaches (Q2410006) (← links)
- Construction of mu-Limit Sets of Two-dimensional Cellular Automata (Q2955001) (← links)
- Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width (Q3010427) (← links)
- Characterization of sets of limit measures of a cellular automaton iterated on a random configuration (Q4643257) (← links)
- (Q4986307) (← links)
- Aperiodic points in $\mathbb Z^2$-subshifts (Q5002814) (← links)
- (Q5010155) (← links)
- Self-organization in Cellular Automata: A Particle-Based Approach (Q5199969) (← links)
- Characterizing asymptotic randomization in abelian cellular automata (Q5220080) (← links)
