An Overview of the Firing Squad Synchronization Problem. - Jacques Mazoyer (Automata Networks, 1986)

A Six-State Minimal Time Solution to the Firing Squad Synchronization Problem. - Jacques Mazoyer (Theor. Comput. Sci., 1987)

A Linear Speed-Up Theorem for Cellular Automata. - Jacques Mazoyer; N. Reimen (Theor. Comput. Sci., 1992)

Growing Patterns in One Dimensional Cellular Automata. - Bruno Durand 001; Jacques Mazoyer (Complex Syst., 1994)

Growing Patterns in 1D Cellular Automata. - Bruno Durand 001; Jacques Mazoyer (FCT, 1995)

Synchronization of Two Interacting Finite Automata. - Jacques Mazoyer (Int. J. Algebra Comput., 1995)

Computations on One Dimensional Cellular Automata. - Jacques Mazoyer (Ann. Math. Artif. Intell., 1996)

On Optimal Solutions to the Firing Squad Synchronization Problem. - Jacques Mazoyer (Theor. Comput. Sci., 1996)

A Shift-Invariant Metric on Szz Inducing a Non-trivial Tolology. - Gianpiero Cattaneo; Enrico Formenti; Luciano Margara; Jacques Mazoyer (MFCS, 1997)

Additive Cellular Automata over Zp and the Bottom of (CA, <=). - Jacques Mazoyer; Ivan Rapaport (MFCS, 1998)

Compass Permits Leader Election. - Jacques Mazoyer; Codrin M. Nichitiu; Eric Rémila (SODA, 1999)

Inducing an Order on Cellular Automata by a Grouping Operation. - Jacques Mazoyer; Ivan Rapaport (Discret. Appl. Math., 1999)

Global fixed point attractors of circular cellular automata and periodic tilings of the plane: Undecidability results. - Jacques Mazoyer; Ivan Rapaport (Discret. Math., 1999)

Discrete Parabolas and Circles on 2D Cellular Automata. - Marianne Delorme; Jacques Mazoyer; Laure Tougne (Theor. Comput. Sci., 1999)

Avant Propos. - Jacques Mazoyer; Renzo Pinzani; Jean-Guy Penaud (Theor. Comput. Sci., 1999)

Signals in One-Dimensional Cellular Automata. - Jacques Mazoyer; Véronique Terrier (Theor. Comput. Sci., 1999)

The Infinite Versions of LOGSPACE != P Are Consistent with the Axioms of Set Theory. - Grégory Lafitte; Jacques Mazoyer (MFCS, 2000)

Algorithms for Leader Election by Cellular Automata. - Codrin M. Nichitiu; Jacques Mazoyer; Eric Rémila (J. Algorithms, 2001)

Signals on Cellular Automata. - Marianne Delorme; Jacques Mazoyer (Collision-Based Computing, 2002)

Pebble Automata. Figures Families Recognition and Universality. - Marianne Delorme; Jacques Mazoyer (Fundam. Informaticae, 2002)

Reconnaissance parallele des langages rationnels sur automates cellulaires plans. - Marianne Delorme; Jacques Mazoyer (Theor. Comput. Sci., 2002)

Real-time recognition of languages on an two-dimensional Archimedean thread. - Marianne Delorme; Jacques Mazoyer (Theor. Comput. Sci., 2004)

Discrete applied problems, cellular automata and lattices: florilegium for E. Goles. - Jacques Demongeot; Jacques Mazoyer (Theor. Comput. Sci., 2004)

One Head Machines from a symbolic approach. - Anahí Gajardo; Jacques Mazoyer (Theor. Comput. Sci., 2007)

Algorithms and computations on cellular automata. - Jacques Mazoyer (JAC, 2008)

Exemples de classes d'automates cellulaires. - Marianne Delorme; Jacques Mazoyer (RAIRO Theor. Informatics Appl., 2008)

Bulking I: An abstract theory of bulking. - Marianne Delorme; Jacques Mazoyer; Nicolas Ollinger; Guillaume Theyssier (Theor. Comput. Sci., 2011)

Bulking II: Classifications of cellular automata. - Marianne Delorme; Jacques Mazoyer; Nicolas Ollinger; Guillaume Theyssier (Theor. Comput. Sci., 2011)

Algorithmic Tools on Cellular Automata. - Marianne Delorme; Jacques Mazoyer (Handbook of Natural Computing, 2012)

Computations on Cellular Automata. - Jacques Mazoyer; Jean-Baptiste Yunès (Handbook of Natural Computing, 2012)