Nicolas Ollinger
Nicolas Ollinger
professeur d'informatique, Université d'Orléans
Verified email at univ-orleans.fr
Title
Cited by
Cited by
Year
Periodicity and immortality in reversible computing
J Kari, N Ollinger
International Symposium on Mathematical Foundations of Computer Science, 419-430, 2008
762008
The quest for small universal cellular automata
N Ollinger
International Colloquium on Automata, Languages, and Programming, 318-329, 2002
622002
Universalities in cellular automata; a (short) survey
N Ollinger
JAC 2008, 102-118, 2008
572008
The intrinsic universality problem of one-dimensional cellular automata
N Ollinger
Annual Symposium on Theoretical Aspects of Computer Science, 632-641, 2003
552003
Automates cellulaires: structures
N Ollinger
Ecole normale supérieure de lyon-ENS LYON, 2002
512002
The commutation of finite sets: a challenging problem
C Choffrut, J Karhumäki, N Ollinger
Theoretical Computer Science 273 (1-2), 69-79, 2002
502002
Bulking II: Classifications of cellular automata
M Delorme, J Mazoyer, N Ollinger, G Theyssier
Theoretical Computer Science 412 (30), 3881-3905, 2011
482011
Bulking I: an abstract theory of bulking
M Delorme, J Mazoyer, N Ollinger, G Theyssier
Theoretical Computer Science 412 (30), 3866-3880, 2011
432011
Bulking I: an abstract theory of bulking
M Delorme, J Mazoyer, N Ollinger, G Theyssier
Theoretical Computer Science 412 (30), 3866-3880, 2011
432011
Two-by-two substitution systems and the undecidability of the domino problem
N Ollinger
Conference on Computability in Europe, 476-485, 2008
332008
Four states are enough!
N Ollinger, G Richard
Theoretical Computer Science 412 (1-2), 22-32, 2011
322011
Combinatorial substitutions and sofic tilings
T Fernique, N Ollinger
arXiv preprint arXiv:1009.5167, 2010
212010
Intrinsically universal cellular automata
N Ollinger
arXiv preprint arXiv:0906.3213, 2009
192009
Universalities in Cellular Automata*
N Ollinger
Handbook of Natural Computing, 189-229, 2012
182012
Introducing freezing cellular automata
E Goles, N Ollinger, G Theyssier
172015
Tiling the plane with a fixed number of polyominoes
N Ollinger
International Conference on Language and Automata Theory and Applications …, 2009
162009
A small minimal aperiodic reversible Turing machine
J Cassaigne, N Ollinger, R Torres-Avilés
Journal of Computer and System Sciences 84, 288-301, 2017
152017
On the computational complexity of the freezing non-strict majority automata
E Goles, D Maldonado, P Montealegre, N Ollinger
International Workshop on Cellular Automata and Discrete Complex Systems …, 2017
102017
On the Computational Complexity of the Freezing Non-strict Majority Automata
E Goles, D Maldonado, P Montealegre, N Ollinger
International Workshop on Cellular Automata and Discrete Complex Systems …, 2017
102017
Undecidability of the Surjectivity of the Subshift Associated to a Turing Machine
R Torres, N Ollinger, A Gajardo
Reversible Computation, 44-56, 2013
102013
The system can't perform the operation now. Try again later.
Articles 1–20