Gaétan Richard — Research

Research interests

I am doing research inside AmacC team of the GREYC laboratory (Normandie univ., UNICAEN, ENSICAEN, CNRS). My main research subject is complexity of simple computation systems; especially cellular automata. My work mixes algorithmic and dynamical systems approaches over those models.

Supervisions

Publications

Peer-reviewed International Journals

  • Nicolas Ollinger and Gaétan Richard. 4 states are enough! Theoretical Computer Science, v. 412 p. 22 - 32, 2011. [ pdf | HAL | doi ]
  • Nicolas Ollinger and Gaétan Richard. Automata on the plane vs particles and collisions. Theoretical Computer Science, v. 410 p. 2767 - 2773, 2009. [ pdf | HAL | doi ]

Proceedings of Peer-reviewed International Conferences

  • Laurent Beaudou, Florent Foucaud, Florent Madelaine, Lhouari Nourine and Gaétan Richard. Complexity of regular path query homomorphisms . In CiE 2019, 2019, To appear.
  • Gaétan Richard. Filling curves constructed in cellular automata with aperiodic tiling . In Automata 2017, p. 165 - 175, 2017. [ pdf | doi ]
  • Gaétan Richard. On the synchronisation problem over cellular automata. In Proceedings of the 34th International Symposium on Theoretical Aspects of Computer Science, v. 66 p. 54:1 - 54:13, 2017. [ pdf | doi  ]
  • Anaël Grandjean, Gaétan Richard and Véronique Terrier. Linear functional classes over cellular automata. In AUTOMATA & JAC 2012, p. 177-193, 2012. [ pdf | doi  ]
  • Alex Borello, Gaétan Richard and Véronique Terrier. A speed-up of oblivious multi-head finite automata by cellular automata. In Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, p. 273-283, 2011. [ pdf | HAL | doi ]
  • Pierre Guillon and Gaétan Richard. Revisiting the Rice theorem on cellular automata. In Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, v. 5 de Leibniz International Proceedings in Informatics (LIPIcs), p. 441 - 452. Schloss Dagstuhl, 2010. [ pdf | HAL | doi ]
  • Gaétan Richard. (un)decidability of injectivity and surjectivity in one-dimensional sand automata. In MFCS, v. 5734 de Lecture Notes in Computer Science, p. 651 - 662. Springer, 2009. [ pdf | doi ]
  • Gaétan Richard. Rule 110: universality and catenations. In Proceedings of the First Symposium on Cellular Automata "Journées Automates Cellulaires", p. 141 - 160. 2008. [ pdf | HAL ]
  • Nicolas Ollinger and Gaétan Richard. Collisions and their catenations: Ultimately periodic tilings of the plane. In Fifth Ifip International Conference On Theoretical Computer Science - Tcs 2008, v. 273, p. 229 - 240. Springer Boston, 2008. [ pdf | HAL | doi ]
  • Pierre Guillon and Gaétan Richard. Nilpotency and limit sets of cellular automata. In MFCS, v. 5162 de Lecture Notes in Computer Science, p. 375 - 386. Springer, 2008. [ pdf | doi ]

Proceedings of Peer-reviewed International Workshops

  • Nicolas Ollinger and Gaétan Richard. A particular cellular automaton. In The Complexity of Simple Programs 2008, p. 205 - 214. 2008. [ pdf | HAL | doi ]

Posters

  • Jacques Madelaine, Gaétan Richard and Gilles Domalain. ThemaMap: a Free Versatile Data Analysis and Visualization Tool. In ISWAG, 2015. [ pdf ]

Other stuff (in French)

  • Étienne Grandjean, Véronique Terrier, and Gaétan Richard. Automates cellulaires. In Informatique Mathématique : Une photographie en 2014 , EJCIM 2014. [ Link ]
  • Gaétan Richard. Systèmes de particules et collisions discrètes dans les automates cellulaires. Phd Thesis, Aix-Marseille université, 2008. [ pdf | TEL ]