Nathalie Aubrun

Orcid: 0000-0002-2701-570X

According to our database1, Nathalie Aubrun authored at least 22 papers between 2009 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
The domino problem is decidable for robust tilesets.
CoRR, 2024

Self-Avoiding Walks on Cayley Graphs Through the Lens of Symbolic Dynamics.
Electron. J. Comb., 2024

2023
Domino Snake Problems on Groups.
Proceedings of the Fundamentals of Computation Theory - 24th International Symposium, 2023

2022
Strongly Aperiodic SFTs on Generalized Baumslag-Solitar groups.
CoRR, 2022

2021
On the domino problem of the Baumslag-Solitar groups.
Theor. Comput. Sci., 2021

Addendum to "Tilings problems on Baumslag-Solitar groups".
CoRR, 2021

Dynamique symbolique sur des groupes : une approche informatique. (Symbolics dynamics on groups: a computer scientist approach).
, 2021

2020
Tilings of the hyperbolic plane of substitutive origin as subshifts of finite type on Baumslag-Solitar groups BS(1, n).
CoRR, 2020

Domino Problem Under Horizontal Constraints.
Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

2019
The Domino Problem is Undecidable on Surface Groups.
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

2017
A notion of effectiveness for subshifts on finitely generated groups.
Theor. Comput. Sci., 2017

2016
Simulation of Effective Subshifts by Two-dimensional Subshifts of Finite Type.
CoRR, 2016

Row-constrained effective sets of colourings in the $2$-fold horocyclic tessellations of $\mathbb{H}^2$ are sofic.
CoRR, 2016

2014
Tree algebra of sofic tree languages.
RAIRO Theor. Informatics Appl., 2014

2013
Sofic Tree-Shifts.
Theory Comput. Syst., 2013

Tiling Problems on Baumslag-Solitar groups.
Proceedings of the Proceedings Machines, Computations and Universality 2013, 2013

2012
Tree-shifts of finite type.
Theor. Comput. Sci., 2012

2011
Dynamique symbolique des systèmes 2D et des arbres infinis. (Symbolic dynamics on multidimensional systems and infinite trees).
PhD thesis, 2011

Multidimensional effective S-adic systems are sofic
CoRR, 2011

2010
Sofic and Almost of Finite Type Tree-Shifts.
Proceedings of the Computer Science, 2010

2009
An Order on Sets of Tilings Corresponding to an Order on Languages.
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

Decidability of Conjugacy of Tree-Shifts of Finite Type.
Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009


  Loading...