Skip to Main content
Number of documents



Journal articles6 documents

Conference papers10 documents

  • Pierre Guillon, Emmanuel Jeandel, Jarkko Kari, Pascal Vanier. Undecidable word problem in subshift automorphism groups. Computer Science in Russia 2019, Jul 2019, Novosibirsk, Russia. ⟨hal-01862896v2⟩
  • Emmanuel Jeandel, Pascal Vanier. A Characterization of Subshifts with Computable Language. STACS 2019 - 36th International Symposium on Theoretical Aspects of Computer Science, Mar 2019, Berlin, Germany. ⟨hal-02133469⟩
  • Etienne Moutot, Pascal Vanier. Slopes of 3-dimensional Subshifts of Finite Type. CSR 2018, Jun 2018, Moscou, Russia. pp.257--268, ⟨10.1007/978-3-319-90530-3_22⟩. ⟨hal-01772574⟩
  • Anaël Grandjean, Benjamin Hellouin de Menibus, Pascal Vanier. Aperiodic points in $\mathbb Z^2$-subshifts. ICALP 2018, Jul 2018, Prague, Czech Republic. ⟨10.4230/LIPIcs.ICALP.2018.496⟩. ⟨hal-01722008v2⟩
  • Michael Hochman, Pascal Vanier. Turing degree spectra of minimal subshifts. Computer Science - Theory and Applications - 12th International Computer Science Symposium in Russia, Jun 2017, Kazan, Russia. ⟨10.1007/978-3-319-58747-9_15⟩. ⟨hal-01058198v4⟩
  • Alex Borello, Julien Cervelle, Pascal Vanier. Turing degrees of limit sets of cellular automata. ICALP 2014, Jul 2014, Copenhaguen, Denmark. pp.74--85, ⟨10.1007/978-3-662-43951-7_7⟩. ⟨hal-00947323⟩
  • Emmanuel Jeandel, Pascal Vanier. Hardness of Conjugacy, Embedding and Factorization of multidimensional Subshifts of Finite Type. STACS 2013 - 30th International Symposium on Theoretical Aspects of Computer Science, Christian-Albrechts - Universität zu Kiel, Feb 2013, Kiel, Germany. pp.490--501, ⟨10.4230/LIPIcs.STACS.2013.490⟩. ⟨hal-00690285⟩
  • Emmanuel Jeandel, Pascal Vanier. Pi01 sets and tilings. Theory and Applications of Models of Computation - 8th Annual Conference, May 2011, Kyoto, Japan. pp.230-239, ⟨10.1007/978-3-642-20877-5_24⟩. ⟨hal-00563458v2⟩
  • Emmanuel Jeandel, Pascal Vanier. Slopes of Tilings. Journées Automates Cellulaires 2010, Dec 2010, Turku, Finland. pp.145-155. ⟨hal-00542000⟩
  • Jarkko Kari, Pascal Vanier, Thomas Zeume. Bounds on Non-surjective Cellular Automata. Mathematical Foundations of Computer Science (MFCS), 2009, Unknown, Unknown Region. pp.439-450. ⟨hal-01194799⟩

Book sections1 document

Preprints, Working Papers, ...2 documents

  • Antonin Callard, Pascal Vanier. Computational characterization of surface entropies for Z² subshifts of finite type. 2021. ⟨hal-03133208v2⟩
  • Ronnie Pavlov, Pascal Vanier. The relationship between word complexity and computational complexity in subshifts. 2019. ⟨hal-02063174⟩