photo

I am a CNRS Junior Researcher in the MC2 research team, part of the LIP in the ENS de Lyon.

I am mainly interested in symbolic dynamics, substitutions, tilings, computability, discrete dynamical systems, combinatorial group theory.

My CV (november 2015).

Email:
nathalie.aubrun ¿ ens-lyon.fr
Office:
Bureau 174, LUG,
7 Allée Pierre de Coubertin
69007 Lyon
Phone:
+33(0)4.37.28.76.45

Publications

International Journals:

  1. Realization of aperiodic subshifts and uniform densities in groups.[pdf]
    Nathalie Aubrun, Sebastián Barbieri and Stéphan Thomassé, To appear in Groups, Geometry and Dynamics.
  2. A notion of effectiveness for subshifts on finitely generated groups.[pdf]
    Nathalie Aubrun, Sebastián Barbieri and Mathieu Sablik, Theoretical Computer Science, Volume 661, p.35-55, 2017.
  3. Tree algebra of sofic tree languages.[pdf][journal]
    Nathalie Aubrun and Marie-Pierre Béal, RAIRO - Theoretical Informatics and Applications, Volume 48, number 4, p.431-451, 2014.
  4. Multidimensional effective S-adic systems are sofic.[pdf]
    Nathalie Aubrun and Mathieu Sablik, Uniform Distribution Theory, Volume 9, issue 2, 2014.
  5. Sofic tree-shifts.[pdf][journal]
    Nathalie Aubrun and Marie-Pierre Béal, Theory of Computing Systems, Volume 53, issue 4, p.621-644, 2013.
  6. Simulation of effective subshifts by two-dimensional subshifts of finite type.[pdf][journal]
    Nathalie Aubrun and Mathieu Sablik, Acta Applicandae Mathematicae, Volume 128, issue 1, p.35-63, 2013.
  7. Tree-shifts of finite type.[pdf][journal]
    Nathalie Aubrun and Marie-Pierre Béal, Theoretical Computer Science, Volume 459, p.16-25, 2012.
International Conferences:

  1. Tiling problems on Baumslag-Solitar groups.[pdf]
    Nathalie Aubrun and Jarkko Kari in Proceedings of Machines, Computations and Universality 2013 (MCU 2013), 2013. p.35-46.
  2. Sofic and almost of finite type tree-shifts.[pdf]
    Nathalie Aubrun and Marie-Pierre Béal in Proceedings of Computer Science in Russia (CSR 2010).
  3. Decidability of conjugacy of tree shifts of finite type.[pdf]
    Nathalie Aubrun and Marie-Pierre Béal in Proceedings of 36th International Colloquium on Automata, Languages and Programming (ICALP 2009), 2009. p.132-143.
  4. An Order on Sets of Tilings Corresponding to an Order on Languages.[pdf]
    Nathalie Aubrun and Mathieu Sablik in Proceedings of 26th International Symposium on Theorical Aspects of Computer Science (STACS 2009), 2009. p. 99-110.
In progress:

  • Row-constrained effective sets of colourings are sofic in the hyperbolic plane.[pdf], with Mathieu Sablik.
Manuscripts:

  • Dynamique symbolique des systèmes 2D et des arbres infinis.[pdf], PhD thesis, defended on 22 of June 2011.
  • Stabilité de classes de sous-shifts par facteurs et sous-actions.[pdf], MSc thesis, Université de Provence (LATP).

Recents talks


Where was I ?