Reference : An S-adic characterization of minimal subshifts with first difference of complexity 1...
Scientific journals : Article
Physical, chemical, mathematical & earth Sciences : Mathematics
http://hdl.handle.net/10993/26291
An S-adic characterization of minimal subshifts with first difference of complexity 1 ≤ p(n + 1) - p(n) ≤ 2
English
Leroy, Julien [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Mathematics Research Unit]
2014
Discrete Mathematics & Theoretical Computer Science
Chapman & Hall
16
1
233--286
Yes (verified by ORBilu)
1365-8050
London
United Kingdom
[en] S-adic conjecture ; factor complexity ; special factor ; Rauz y graph
[en] In [Ergodic Theory Dynam. System, 16 (1996) 663–682], S. Ferenczi proved that any minimal subshift with first difference of complexity bounded by 2 is S-adic with Card(S)≤ 3^27. In this paper, we improve this result by giving an S-adic charaterization of these subshifts with a set
S of 5 morphisms, solving by this way the S-adic conjecture for this particular case.
http://hdl.handle.net/10993/26291
http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2374

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Limited access
An S-adic characterization of minimal subshifts with first difference of complexity.pdfAuthor preprint890.94 kBRequest a copy

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.