18 citations · 45 across the 6 of their papers we have counts for
3 papers · 1 filter
Infinite Time Cellular Automata: A Real Computation Model
Fabien Givors, Grégory Lafitte, Nicolas Ollinger
We define a new transfinite time model of computation, infinite time cellular automata. The model is shown to be as powerful than infinite time Turing machines, both on finite and…
Combinatorial substitutions and sofic tilings
Thomas Fernique, Nicolas Ollinger
A combinatorial substitution is a map over tilings which allows to define sets of tilings with a strong hierarchical structure. In this paper, we show that such sets of tilings are…
Bulking II: Classifications of Cellular Automata
Marianne Delorme, Jacques Mazoyer, Nicolas Ollinger +1
This paper is the second part of a series of two papers dealing with bulking: a way to define quasi-order on cellular automata by comparing space-time diagrams up to rescaling. In…