default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNathalie Aubrun
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Nathalie Aubrun, Nicolás Bitar:
Self-Avoiding Walks on Cayley Graphs Through the Lens of Symbolic Dynamics. Electron. J. Comb. 31(4) (2024)- [i10]Nathalie Aubrun, Manon Blanc, Olivier Bournez:
The domino problem is decidable for robust tilesets. CoRR abs/2402.04438 (2024) - 2023
- [c7]Nathalie Aubrun
, Nicolas Bitar:
Domino Snake Problems on Groups. FCT 2023: 46-59 - [i9]Nathalie Aubrun, Nicolas Bitar:
Domino Snake Problems on Groups. CoRR abs/2307.12655 (2023) - 2022
- [i8]Nathalie Aubrun, Nicolas Bitar, Sacha Huriot-Tattegrain:
Strongly Aperiodic SFTs on Generalized Baumslag-Solitar groups. CoRR abs/2204.11492 (2022) - 2021
- [b2]Nathalie Aubrun:
Dynamique symbolique sur des groupes : une approche informatique. (Symbolics dynamics on groups: a computer scientist approach). University of Paris-Saclay, France, 2021 - [j5]Nathalie Aubrun, Jarkko Kari:
On the domino problem of the Baumslag-Solitar groups. Theor. Comput. Sci. 894: 12-22 (2021) - [i7]Nathalie Aubrun, Jarkko Kari:
Addendum to "Tilings problems on Baumslag-Solitar groups". CoRR abs/2101.12470 (2021) - 2020
- [c6]Nathalie Aubrun, Julien Esnay, Mathieu Sablik:
Domino Problem Under Horizontal Constraints. STACS 2020: 26:1-26:15 - [i6]Nathalie Aubrun, Michael Schraudner:
Tilings of the hyperbolic plane of substitutive origin as subshifts of finite type on Baumslag-Solitar groups BS(1, n). CoRR abs/2012.11037 (2020)
2010 – 2019
- 2019
- [c5]Nathalie Aubrun, Sebastián Barbieri, Etienne Moutot:
The Domino Problem is Undecidable on Surface Groups. MFCS 2019: 46:1-46:14 - 2018
- [i5]Nathalie Aubrun, Sebastián Barbieri, Etienne Moutot:
The domino problem is undecidable on surface groups. CoRR abs/1811.08420 (2018) - 2017
- [j4]Nathalie Aubrun, Sebastián Barbieri, Mathieu Sablik:
A notion of effectiveness for subshifts on finitely generated groups. Theor. Comput. Sci. 661: 35-55 (2017) - 2016
- [i4]Nathalie Aubrun, Mathieu Sablik:
Row-constrained effective sets of colourings in the $2$-fold horocyclic tessellations of $\mathbb{H}^2$ are sofic. CoRR abs/1602.04061 (2016) - [i3]Nathalie Aubrun, Mathieu Sablik:
Simulation of Effective Subshifts by Two-dimensional Subshifts of Finite Type. CoRR abs/1602.06095 (2016) - 2014
- [j3]Nathalie Aubrun, Marie-Pierre Béal:
Tree algebra of sofic tree languages. RAIRO Theor. Informatics Appl. 48(4): 431-451 (2014) - 2013
- [j2]Nathalie Aubrun, Marie-Pierre Béal:
Sofic Tree-Shifts. Theory Comput. Syst. 53(4): 621-644 (2013) - [c4]Nathalie Aubrun, Jarkko Kari:
Tiling Problems on Baumslag-Solitar groups. MCU 2013: 35-46 - 2012
- [j1]Nathalie Aubrun, Marie-Pierre Béal:
Tree-shifts of finite type. Theor. Comput. Sci. 459: 16-25 (2012) - 2011
- [b1]Nathalie Aubrun:
Dynamique symbolique des systèmes 2D et des arbres infinis. (Symbolic dynamics on multidimensional systems and infinite trees). University of Paris-Est, France, 2011 - [i2]Nathalie Aubrun, Mathieu Sablik:
Multidimensional effective S-adic systems are sofic. CoRR abs/1103.0895 (2011) - 2010
- [c3]Nathalie Aubrun, Marie-Pierre Béal:
Sofic and Almost of Finite Type Tree-Shifts. CSR 2010: 12-24
2000 – 2009
- 2009
- [c2]Nathalie Aubrun, Marie-Pierre Béal:
Decidability of Conjugacy of Tree-Shifts of Finite Type. ICALP (1) 2009: 132-143 - [c1]Nathalie Aubrun, Mathieu Sablik:
An Order on Sets of Tilings Corresponding to an Order on Languages. STACS 2009: 99-110 - [i1]Nathalie Aubrun, Mathieu Sablik:
An Order on Sets of Tilings Corresponding to an Order on Languages. CoRR abs/0902.1602 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-08 21:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
