Nicolas Ollinger

Jeffrey O. Shallit

CoRR, 2024

Addition in Dumont-Thomas Numeration Systems in Theory and Practice.

[BibT_eX]

[DOI]

CoRR, 2024

2022

Freezing, Bounded-Change and Convergent Cellular Automata.

[BibT_eX]

[DOI]

Guillaume Theyssier

Discret. Math. Theor. Comput. Sci., 2022

2020

On the complexity of the stability problem of binary freezing totalistic cellular automata.

[BibT_eX]

[DOI]

Inf. Comput., 2020

2018

On Aperiodic Reversible Turing Machines (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the Reversible Computation - 10th International Conference, 2018

Universality in Freezing Cellular Automata.

[BibT_eX]

[DOI]

Proceedings of the Sailing Routes in the World of Computation, 2018

Fast-Parallel Algorithms for Freezing Totalistic Asynchronous Cellular Automata.

[BibT_eX]

[DOI]

Eric Goles

Diego Maldonado

Pedro Montealegre-Barba

Proceedings of the Cellular Automata, 2018

2017

A small minimal aperiodic reversible Turing machine.

[BibT_eX]

[DOI]

Julien Cassaigne

J. Comput. Syst. Sci., 2017

Permutive One-Way Cellular Automata and the Finiteness Problem for Automaton Groups.

[BibT_eX]

[DOI]

Martin Delacourt

Proceedings of the Unveiling Dynamics and Complexity, 2017

On the Computational Complexity of the Freezing Non-strict Majority Automata.

[BibT_eX]

[DOI]

Proceedings of the Cellular Automata and Discrete Complex Systems, 2017

2015

Some undecidable problems about the trace-subshift associated to a Turing machine.

[BibT_eX]

[DOI]

Anahí Gajardo

Discret. Math. Theor. Comput. Sci., 2015

Front Matter, Table of Contents, Preface, Conference Organization.

[BibT_eX]

[DOI]

Ernst W. Mayr

Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

The Transitivity Problem of Turing Machines.

[BibT_eX]

[DOI]

Anahí Gajardo

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

2014

Knight Tiles: Particles and Collisions in the Realm of 4-Way Deterministic Tilings.

[BibT_eX]

[DOI]

Bastien Le Gloannec

Proceedings of the Developments in Language Theory - 18th International Conference, 2014

2012

Universalities in Cellular Automata.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Natural Computing, 2012

Undecidability of the Surjectivity of the Subshift Associated to a Turing Machine.

[BibT_eX]

[DOI]

Anahí Gajardo

Proceedings of the Reversible Computation, 4th International Workshop, 2012

Substitutions and Strongly Deterministic Tilesets.

[BibT_eX]

[DOI]

Bastien Le Gloannec

Proceedings of the How the World Computes, 2012

2011

Four states are enough!

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Bulking II: Classifications of cellular automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Bulking I: An abstract theory of bulking.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Tutorial on Cellular Automata.

[BibT_eX]

[DOI]

Proceedings of the Unconventional Computation - 10th International Conference, 2011

2010

Infinite Time Cellular Automata: a Real Computation Model.

[BibT_eX]

[DOI]

Fabien Givors

Grégory Lafitte

Proceedings of the Second Symposium on Cellular Automata "Journées Automates Cellulaires", 2010

Combinatorial Substitutions and Sofic Tilings.

[BibT_eX]

[DOI]

Thomas Fernique

Proceedings of the Second Symposium on Cellular Automata "Journées Automates Cellulaires", 2010

2009

Automata on the plane vs particles and collisions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Tiling the Plane with a Fixed Number of Polyominoes.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2009

2008

Playing with Conway's problem.

[BibT_eX]

[DOI]

Emmanuel Jeandel

Theor. Comput. Sci., 2008

A Particular Universal Cellular Automaton

[BibT_eX]

[DOI]

Proceedings of the Proceedings International Workshop on The Complexity of Simple Programs, 2008

Intrinsically Universal Cellular Automata

[BibT_eX]

[DOI]

Proceedings of the Proceedings International Workshop on The Complexity of Simple Programs, 2008

Periodicity and Immortality in Reversible Computing.

[BibT_eX]

[DOI]

Jarkko Kari

Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

Universalities in cellular automata a (short) survey.

[BibT_eX]

Proceedings of the First Symposium on Cellular Automata "Journées Automates Cellulaires" (JAC 2008), 2008

Collisions and their Catenations: Ultimately Periodic Tilings of the Plane.

[BibT_eX]

[DOI]

Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

Two-by-Two Substitution Systems and the Undecidability of the Domino Problem.

[BibT_eX]

[DOI]

Proceedings of the Logic and Theory of Algorithms, 2008

Programmation et indécidabilités dans les systèmes complexes. (Programming and undecidability in complex systems).

[BibT_eX]

[DOI]

, 2008

2003

The Intrinsic Universality Problem of One-Dimensional Cellular Automata.

[BibT_eX]

[DOI]

Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

2002

Automates cellulaires : structures. (Cellular automata: structures).

[BibT_eX]

[DOI]

PhD thesis, 2002

The commutation of finite sets: a challenging problem.

[BibT_eX]

[DOI]

Christian Choffrut

Juhani Karhumäki

Theor. Comput. Sci., 2002

The Quest for Small Universal Cellular Automata.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

2001

Two-States Bilinear Intrinsically Universal Cellular Automata.

[BibT_eX]

[DOI]