Article (Scientific journals)
An S-adic characterization of minimal subshifts with first difference of complexity 1 ≤ p(n + 1) - p(n) ≤ 2
Leroy, Julien
2014In Discrete Mathematics and Theoretical Computer Science, 16 (1), p. 233--286
Peer reviewed
 

Files


Full Text
An S-adic characterization of minimal subshifts with first difference of complexity.pdf
Author preprint (912.32 kB)
Request a copy

All documents in ORBilu are protected by a user license.

Send to



Details



Keywords :
S-adic conjecture; factor complexity; special factor; Rauz y graph
Abstract :
[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.
Disciplines :
Mathematics
Author, co-author :
Leroy, Julien ;  University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Mathematics Research Unit
External co-authors :
no
Language :
English
Title :
An S-adic characterization of minimal subshifts with first difference of complexity 1 ≤ p(n + 1) - p(n) ≤ 2
Publication date :
2014
Journal title :
Discrete Mathematics and Theoretical Computer Science
ISSN :
1365-8050
Publisher :
Chapman & Hall, London, United Kingdom
Volume :
16
Issue :
1
Pages :
233--286
Peer reviewed :
Peer reviewed
Available on ORBilu :
since 25 March 2016

Statistics


Number of views
55 (5 by Unilu)
Number of downloads
0 (0 by Unilu)

Scopus citations®
 
11
Scopus citations®
without self-citations
6
WoS citations
 
12

Bibliography


Similar publications



Contact ORBilu