Bruno Durand

Discret. Comput. Geom., 2020

2019

An algorithmic approach to characterizations of admissibles.

[BibT_eX]

[DOI]

Grégory Lafitte

Proceedings of the Computing with Foresight and Industry, 2019

2018

The expressiveness of quasiperiodic and minimal shifts of finite type.

[BibT_eX]

[DOI]

CoRR, 2018

2017

Aperiodic tilings and entropy.

[BibT_eX]

[DOI]

Guilhem Gamard

Anaël Grandjean

Theor. Comput. Sci., 2017

On the Expressive Power of Quasiperiodic SFT.

[BibT_eX]

[DOI]

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Infinite Time Busy Beavers.

[BibT_eX]

[DOI]

Oscar Defrain

Grégory Lafitte

Proceedings of the Unveiling Dynamics and Complexity, 2017

Admissibles in Gaps.

[BibT_eX]

[DOI]

Proceedings of the Unveiling Dynamics and Complexity, 2017

2015

Quasiperiodicity and Non-computability in Tilings.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

2013

Discrete mathematical structures: From dynamics to complexity.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

2012

Fixed-point tile sets and their applications.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2012

2010

Tilings Robust to Errors.

[BibT_eX]

[DOI]

Alexis Ballier

Emmanuel Jeandel

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

1D Effectively Closed Subshifts and 2D Tilings.

[BibT_eX]

[DOI]

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

Effective Closed Subshifts in 1D Can Be Implemented in 2D.

[BibT_eX]

[DOI]

Proceedings of the Fields of Logic and Computation, 2010

2009

Fixed Point Theorem and Aperiodic Tilings.

[BibT_eX]

Bull. EATCS, 2009

High Complexity Tilings with Sparse Errors.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

Asymptotic Cellular Complexity.

[BibT_eX]

[DOI]

Victor Poupet

Proceedings of the Developments in Language Theory, 13th International Conference, 2009

2008

Complex tilings.

[BibT_eX]

[DOI]

Leonid A. Levin

J. Symb. Log., 2008

Fixed Point and Aperiodic Tilings.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2008

Structural aspects of tilings.

[BibT_eX]

[DOI]

Alexis Ballier

Emmanuel Jeandel

Proceedings of the STACS 2008, 2008

Preface.

[BibT_eX]

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

2007

Foreword.

[BibT_eX]

[DOI]

Volker Diekert

Theory Comput. Syst., 2007

2005

A new dimension sensitive property for cellular automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

2004

Tilings: recursivity and regularity.

[BibT_eX]

[DOI]

Julien Cervelle

Theor. Comput. Sci., 2004

Kolmogorov-Loveland stochasticity for finite strings.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2004

Ecological Turing Machines.

[BibT_eX]

[DOI]

Andrei A. Muchnik

Maxim Ushakov

Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

2003

Do stronger definitions of randomness exist?

[BibT_eX]

[DOI]

Vladimir Kanovei

Vladimir A. Uspensky

Theor. Comput. Sci., 2003

Number-conserving cellular automata I: decidability.

[BibT_eX]

[DOI]

Zsuzsanna Róka

Theor. Comput. Sci., 2003

On undecidability of equicontinuity classification for cellular automata.

[BibT_eX]

[DOI]

Georges Varouchas

Proceedings of the Discrete Models for Complex Systems, 2003

Number conserving cellular automata: new results on decidability and dynamics.

[BibT_eX]

[DOI]

Proceedings of the Discrete Models for Complex Systems, 2003

2002

Descriptive complexity of computable sequences.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Comparison between the complexity of a function and the complexity of its graph.

[BibT_eX]

[DOI]

Sylvain Porrot

Theor. Comput. Sci., 2002

De la logique aux pavages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Kolmogorov Complexity - Foreword.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

2001

Kolmogorov complexity and cellular automata classification.

[BibT_eX]

[DOI]

Jean-Christophe Dubacq

Theor. Comput. Sci., 2001

Algorithmic Information Theory and Cellular Automata Dynamics.

[BibT_eX]

[DOI]

Julien Cervelle

Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

1999

On the Complexity of Deadlock Detection in Families of Planar Nets.

[BibT_eX]

[DOI]

Anne-Cécile Fabret

Theor. Comput. Sci., 1999

Tilings and Quasiperiodicity.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1999

1998

Deterministic Rational Transducers and Random Sequences.

[BibT_eX]

[DOI]

Sylvain Porrot

Max Dauchet

Proceedings of the Foundations of Software Science and Computation Structure, 1998

1996

Self-Similarity Viewed as a Local Property via Tile Sets.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1996, 1996

1995

A Random NP-Complete Problem for Inversion of 2D Cellular Automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1995

Growing Patterns in 1D Cellular Automata.

[BibT_eX]

[DOI]

Jacques Mazoyer

Proceedings of the Fundamentals of Computation Theory, 10th International Symposium, 1995

1994

Inversion of 2D Cellular Automata: Some Complexity Results.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1994

The Surjectivity Problem for 2D Cellular Automata.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1994

Growing Patterns in One Dimensional Cellular Automata.

[BibT_eX]

[DOI]

Jacques Mazoyer

Complex Syst., 1994

Automates cellulaires - reversibilite et complexite.

[BibT_eX]

PhD thesis, 1994

1993

Global Properties of 2D Cellular Automata: Some Complexity Results.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

Undecidability of the Surjectivity Problem for 2D Cellular Automata: A Simplified Proof.

[BibT_eX]

[DOI]