Nicolas Ollinger

48 papers A* 1A 4B 2C 9Journal 19Unranked 10
YearRankTypeTitle / Venue / Authors
2025 J jnl
Effective Computation of Generalized Abelian Complexity for Pisot Type Substitutive Sequences.
CoRR
Jean-Michel Couvreur, Martin Delacourt, Nicolas Ollinger, Pierre Popoli, Jeffrey O. Shallit, Manon Stipulanti
2025 — conf
Linear Recurrence Sequence Automata and the Addition of Abstract Numeration Systems.
WORDS
Olivier Carton, Jean-Michel Couvreur, Martin Delacourt, Nicolas Ollinger
2024 J jnl
Addition in Dumont-Thomas Numeration Systems in Theory and Practice.
CoRR
Olivier Carton, Jean-Michel Couvreur, Martin Delacourt, Nicolas Ollinger
2024 J jnl
The Repetition Threshold for Rote Sequences.
CoRR
Nicolas Ollinger, Jeffrey O. Shallit
2022 J jnl
Freezing, Bounded-Change and Convergent Cellular Automata.
Discret. Math. Theor. Comput. Sci.
Nicolas Ollinger, Guillaume Theyssier
2020 J jnl
On the complexity of the stability problem of binary freezing totalistic cellular automata.
Inf. Comput.
Eric Goles, Diego Maldonado, Pedro Montealegre, Nicolas Ollinger
2019 J jnl
Freezing, Bounded-Change and Convergent Cellular Automata.
CoRR
Nicolas Ollinger, Guillaume Theyssier
2019 J jnl
On the Complexity of the Stability Problem of Binary Freezing Totalistic Cellular Automata.
CoRR
Eric Goles, Diego Maldonado, Pedro Montealegre, Nicolas Ollinger
2018 — conf
Fast-Parallel Algorithms for Freezing Totalistic Asynchronous Cellular Automata.
ACRI
Eric Goles, Diego Maldonado, Pedro Montealegre-Barba, Nicolas Ollinger
2018 C conf
On Aperiodic Reversible Turing Machines (Invited Talk).
RC
Nicolas Ollinger
2018 C conf
Universality in Freezing Cellular Automata.
CiE
Florent Becker, Diego Maldonado, Nicolas Ollinger, Guillaume Theyssier
2018 J jnl
Universality in Freezing Cellular Automata.
CoRR
Florent Becker, Diego Maldonado, Nicolas Ollinger, Guillaume Theyssier
2017 J jnl
A small minimal aperiodic reversible Turing machine.
J. Comput. Syst. Sci.
Julien Cassaigne, Nicolas Ollinger, Rodrigo Torres-Avilés
2017 — conf
On the Computational Complexity of the Freezing Non-strict Majority Automata.
AUTOMATA
Eric Goles, Diego Maldonado, Pedro Montealegre, Nicolas Ollinger
2017 C conf
Permutive One-Way Cellular Automata and the Finiteness Problem for Automaton Groups.
CiE
Martin Delacourt, Nicolas Ollinger
2016 A ed.
33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, Orléans, France, February 17-20, 2016
STACS
Nicolas Ollinger, Heribert Vollmer
2015 A ed.
32nd International Symposium on Theoretical Aspects of Computer Science, STACS 2015, Garching, Germany, March 4-7, 2015
STACS
Ernst W. Mayr, Nicolas Ollinger
2015 A conf
Front Matter, Table of Contents, Preface, Conference Organization.
STACS
Ernst W. Mayr, Nicolas Ollinger
2015 J jnl
Some undecidable problems about the trace-subshift associated to a Turing machine.
Discret. Math. Theor. Comput. Sci.
Anahí Gajardo, Nicolas Ollinger, Rodrigo Torres-Avilés
2015 — conf
The Transitivity Problem of Turing Machines.
MFCS (1)
Anahí Gajardo, Nicolas Ollinger, Rodrigo Torres-Avilés
2014 C conf
Knight Tiles: Particles and Collisions in the Realm of 4-Way Deterministic Tilings.
Developments in Language Theory
Bastien Le Gloannec, Nicolas Ollinger
2012 C conf
Substitutions and Strongly Deterministic Tilesets.
CiE
Bastien Le Gloannec, Nicolas Ollinger
2012 C conf
Undecidability of the Surjectivity of the Subshift Associated to a Turing Machine.
RC
Rodrigo Torres-Avilés, Nicolas Ollinger, Anahí Gajardo
2012 — ch.
Universalities in Cellular Automata.
Handbook of Natural Computing
Nicolas Ollinger
2011 J jnl
Bulking I: An abstract theory of bulking.
Theor. Comput. Sci.
Marianne Delorme, Jacques Mazoyer, Nicolas Ollinger, Guillaume Theyssier
2011 J jnl
Bulking II: Classifications of cellular automata.
Theor. Comput. Sci.
Marianne Delorme, Jacques Mazoyer, Nicolas Ollinger, Guillaume Theyssier
2011 J jnl
Four states are enough!
Theor. Comput. Sci.
Nicolas Ollinger, Gaétan Richard
2011 C conf
Tutorial on Cellular Automata.
UC
Nicolas Ollinger
2010 J jnl
Bulking II: Classifications of Cellular Automata
CoRR
Marianne Delorme, Jacques Mazoyer, Nicolas Ollinger, Guillaume Theyssier
2010 — conf
Combinatorial Substitutions and Sofic Tilings.
JAC
Thomas Fernique, Nicolas Ollinger
2010 J jnl
Combinatorial substitutions and sofic tilings
CoRR
Thomas Fernique, Nicolas Ollinger
2010 J jnl
Infinite Time Cellular Automata: A Real Computation Model
CoRR
Fabien Givors, Grégory Lafitte, Nicolas Ollinger
2010 — conf
Infinite Time Cellular Automata: a Real Computation Model.
JAC
Fabien Givors, Grégory Lafitte, Nicolas Ollinger
2009 J jnl
Automata on the plane vs particles and collisions.
Theor. Comput. Sci.
Nicolas Ollinger, Gaétan Richard
2009 C conf
Tiling the Plane with a Fixed Number of Polyominoes.
LATA
Nicolas Ollinger
2008 — conf
A Particular Universal Cellular Automaton
CSP
Nicolas Ollinger, Gaétan Richard
2008 — conf
Collisions and their Catenations: Ultimately Periodic Tilings of the Plane.
IFIP TCS
Nicolas Ollinger, Gaétan Richard
2008 — conf
Intrinsically Universal Cellular Automata
CSP
Nicolas Ollinger
2008 B conf
Periodicity and Immortality in Reversible Computing.
MFCS
Jarkko Kari, Nicolas Ollinger
2008 J jnl
Playing with Conway's problem.
Theor. Comput. Sci.
Emmanuel Jeandel, Nicolas Ollinger
2008 — book
Programmation et indécidabilités dans les systèmes complexes. (Programming and undecidability in complex systems).
Nicolas Ollinger
2008 C conf
Two-by-Two Substitution Systems and the Undecidability of the Domino Problem.
CiE
Nicolas Ollinger
2008 — conf
Universalities in cellular automata a (short) survey.
JAC
Nicolas Ollinger
2003 A conf
The Intrinsic Universality Problem of One-Dimensional Cellular Automata.
STACS
Nicolas Ollinger
2002 — —
Automates cellulaires : structures. (Cellular automata: structures).
Nicolas Ollinger
2002 A* conf
The Quest for Small Universal Cellular Automata.
ICALP
Nicolas Ollinger
2002 J jnl
The commutation of finite sets: a challenging problem.
Theor. Comput. Sci.
Christian Choffrut, Juhani Karhumäki, Nicolas Ollinger
2001 B conf
Two-States Bilinear Intrinsically Universal Cellular Automata.
FCT
Nicolas Ollinger