Coding rotations on intervals

We show that the coding of a rotation by α on m intervals can be recoded over m Sturmian words of angle α.

Saved in:
Bibliographic Details
Published inTheoretical computer science Vol. 281; no. 1-2; pp. 99 - 107
Main Authors Berstel, Jean, Vuillon, Laurent
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 03.06.2002
Elsevier
Subjects
Applied sciences
Computer Science
Computer science; control theory; systems
Data processing. List processing. Character string processing
Data Structures and Algorithms
Exact sciences and technology
Memory organisation. Data processing
Software
Alphabet
Infinite word
Sturmian word
Coding
Rotation
Word combinatorics
Online AccessGet full text

Cover

Abstract We show that the coding of a rotation by α on m intervals can be recoded over m Sturmian words of angle α.
AbstractList A proof is presented to show that the coding of a rotation by alpha on m intervals can be recoded over m Sturmian words on angle alpha . The coding of rotations is a method to construct infinite words over a finite alphabet. The use of automaton which is the same for all (m+1) tuples of Sturmian words, is illustrated.
We show that the coding of a rotation by α on m intervals can be recoded over m Sturmian words of angle α.
Author Vuillon, Laurent
Berstel, Jean
Author_xml – sequence: 1
  givenname: Jean
  surname: Berstel
  fullname: Berstel, Jean
  organization: Institut Gaspard Monge (IGM), Université de Marne-la-Vallée, 5, boulevard Descartes, 77454 Marne-la-Vallée Cédex 2, France
– sequence: 2
  givenname: Laurent
  surname: Vuillon
  fullname: Vuillon, Laurent
  email: laurent.vuillon@liafa.jussieu.fr
  organization: Laboratoire d'informatique algorithmique: fondements et applications (LIAFA) and CNRS, Université Denis-Diderot (Paris VII), 2, place Jussieu, 75251 Paris Cédex 05, France
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=13707568$$DView record in Pascal Francis
https://hal.science/hal-00619502$$DView record in HAL
BookMark eNqFkE1LAzEQhoMo2FZ_QqEXxR5W87HZbE5Silqh4EE9h5CdaGSb1GRb8N-bdks9OocZGJ6ZF54hOvXBA0Jjgm8JJtXdK2a4LJgU_AbTKc4lC3mCBqQWsqBUlqdocETO0TClrx3ERTVA43lonP-YxNDpzgWfJsFPnO8gbnWbLtCZzQMuD3OE3h8f3uaLYvny9DyfLQtTYtoV0gpLoQLJgddMC2G4bsqKihoEw5WQjNK6JJqI2lCqa05AWiuAMEasyH2Epv3fT92qdXQrHX9U0E4tZku122FcEckx3ZLMXvfsOobvDaROrVwy0LbaQ9gkRQUupWBlBnkPmhhSimCPnwlWO3FqL07trChM1V6ckvnu6hCgk9Gtjdobl_6OmcCCV3Xm7nsOspmtg6iSceANNC6C6VQT3D9Jv99If_g
CODEN TCSCDI
CitedBy_id crossref_primary_10_1016_j_dam_2014_11_020
crossref_primary_10_1016_j_automatica_2022_110574
crossref_primary_10_1016_j_matpur_2005_11_002
crossref_primary_10_1016_j_indag_2016_11_018
crossref_primary_10_1051_ita_2014019
crossref_primary_10_1016_j_tcs_2009_09_034
crossref_primary_10_2969_jmsj_05941199
crossref_primary_10_1051_ita_2009003
Cites_doi 10.4064/aa-85-2-157-177
10.1016/S0304-3975(97)00105-9
10.1016/0304-3975(95)00208-1
10.1006/jnth.1994.1012
ContentType Journal Article
Copyright 2002 Elsevier Science B.V.
2002 INIST-CNRS
Distributed under a Creative Commons Attribution 4.0 International License
Copyright_xml – notice: 2002 Elsevier Science B.V.
– notice: 2002 INIST-CNRS
– notice: Distributed under a Creative Commons Attribution 4.0 International License
DBID 6I.
AAFTH
IQODW
AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
1XC
DOI 10.1016/S0304-3975(02)00009-9
DatabaseName ScienceDirect Open Access Titles
Elsevier:ScienceDirect:Open Access
Pascal-Francis
CrossRef
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
Hyper Article en Ligne (HAL)
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList Computer and Information Systems Abstracts
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
Computer Science
Applied Sciences
EISSN 1879-2294
EndPage 107
ExternalDocumentID oai_HAL_hal_00619502v1
10_1016_S0304_3975_02_00009_9
13707568
S0304397502000099
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
123
1B1
1RT
1~.
1~5
29Q
4.4
457
4G.
5VS
6I.
7-5
71M
8P~
9JN
AABNK
AACTN
AAEDT
AAEDW
AAFTH
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAXUO
AAYFN
ABAOU
ABBOA
ABJNI
ABMAC
ABTAH
ABVKL
ABXDB
ABYKQ
ACAZW
ACDAQ
ACGFS
ACNNM
ACRLP
ACZNC
ADBBV
ADEZE
ADMUD
AEKER
AENEX
AEXQZ
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHZHX
AIALX
AIEXJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
ARUGR
AXJTR
BKOJK
BLXMC
CS3
DU5
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
F5P
FDB
FEDTE
FIRID
FNPLU
FYGXN
G-Q
GBOLZ
HVGLF
HZ~
IHE
IXB
J1W
KOM
LG9
M26
M41
MHUIS
MO0
N9A
NCXOZ
O-L
O9-
OAUVE
OK1
OZT
P-9
P2P
PC.
Q38
RIG
ROL
RPZ
SCC
SDF
SDG
SES
SPC
SPCBC
SSV
SSW
SSZ
T5K
TN5
WH7
XJT
YNT
ZMT
ZY4
~G-
AAQXK
ABEFU
ABFNM
ABPIF
ABPTK
AEBSH
ASPBG
AVWKF
AZFZN
FGOYB
G-2
G8K
GBLVA
IQODW
P-8
R2-
SEW
TAE
WUQ
0SF
AAXKI
AAYXX
ADVLN
AFJKZ
AKRWK
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
1XC
ID FETCH-LOGICAL-c402t-9f7f2e6e95e583a77c5ad46278e730679322841a178c22a851e9ff7e1331f7133
IEDL.DBID ABVKL
ISSN 0304-3975
IngestDate Tue Oct 15 16:06:07 EDT 2024
Sat Oct 05 05:49:26 EDT 2024
Thu Sep 26 18:26:18 EDT 2024
Sun Oct 22 16:06:07 EDT 2023
Fri Feb 23 02:33:37 EST 2024
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 1-2
Keywords Alphabet
Infinite word
Sturmian word
Coding
Rotation
Word combinatorics
Language English
License http://www.elsevier.com/open-access/userlicense/1.0
CC BY 4.0
Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c402t-9f7f2e6e95e583a77c5ad46278e730679322841a178c22a851e9ff7e1331f7133
Notes ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
OpenAccessLink https://www.sciencedirect.com/science/article/pii/S0304397502000099
PQID 27049734
PQPubID 23500
PageCount 9
ParticipantIDs hal_primary_oai_HAL_hal_00619502v1
proquest_miscellaneous_27049734
crossref_primary_10_1016_S0304_3975_02_00009_9
pascalfrancis_primary_13707568
elsevier_sciencedirect_doi_10_1016_S0304_3975_02_00009_9
PublicationCentury 2000
PublicationDate 2002-06-03
PublicationDateYYYYMMDD 2002-06-03
PublicationDate_xml – month: 06
  year: 2002
  text: 2002-06-03
  day: 03
PublicationDecade 2000
PublicationPlace Amsterdam
PublicationPlace_xml – name: Amsterdam
PublicationTitle Theoretical computer science
PublicationYear 2002
Publisher Elsevier B.V
Elsevier
Publisher_xml – name: Elsevier B.V
– name: Elsevier
References Alessandri, Berthé (BIB1) 1998; 44
V. Berthé, Etude arithmétique et dynamique de suites algorithmiques, Habilitation à diriger des reserches, Université d'Aix-Marseille II, 1999.
Hubert (BIB6) 1996; 164
J. Berstel, P. Séébold, Sturmian words, in: M. Lothaire (Ed.), Algebraic Combinatorics on Words, Chap. 2, Cambridge University Press, Cambridge, to appear.
Blanchard, Kurka (BIB4) 1998; 209
Rote (BIB7) 1994; 46
Didier (BIB5) 1998; 85
10.1016/S0304-3975(02)00009-9_BIB2
Rote (10.1016/S0304-3975(02)00009-9_BIB7) 1994; 46
Hubert (10.1016/S0304-3975(02)00009-9_BIB6) 1996; 164
10.1016/S0304-3975(02)00009-9_BIB3
Didier (10.1016/S0304-3975(02)00009-9_BIB5) 1998; 85
Blanchard (10.1016/S0304-3975(02)00009-9_BIB4) 1998; 209
Alessandri (10.1016/S0304-3975(02)00009-9_BIB1) 1998; 44
References_xml – volume: 44
  start-page: 103
  year: 1998
  end-page: 132
  ident: BIB1
  article-title: Three distance theorems and combinatorics on words
  publication-title: Enseig. Math.
  contributor:
    fullname: Berthé
– volume: 209
  start-page: 179
  year: 1998
  end-page: 193
  ident: BIB4
  article-title: Language complexity of rotations and Sturmian sequences
  publication-title: Theoret. Comput. Sci.
  contributor:
    fullname: Kurka
– volume: 46
  start-page: 196
  year: 1994
  end-page: 213
  ident: BIB7
  article-title: Sequences with subword complexity 2
  publication-title: J. Number Theory
  contributor:
    fullname: Rote
– volume: 85
  start-page: 157
  year: 1998
  end-page: 177
  ident: BIB5
  article-title: Combinatoire des codages de rotations
  publication-title: Acta Arith.
  contributor:
    fullname: Didier
– volume: 164
  start-page: 165
  year: 1996
  end-page: 183
  ident: BIB6
  article-title: Propriétés combinatoires des suites défines par billard dans les triangles pavants
  publication-title: Theoret. Comput. Sci.
  contributor:
    fullname: Hubert
– volume: 85
  start-page: 157
  year: 1998
  ident: 10.1016/S0304-3975(02)00009-9_BIB5
  article-title: Combinatoire des codages de rotations
  publication-title: Acta Arith.
  doi: 10.4064/aa-85-2-157-177
  contributor:
    fullname: Didier
– ident: 10.1016/S0304-3975(02)00009-9_BIB2
– ident: 10.1016/S0304-3975(02)00009-9_BIB3
– volume: 209
  start-page: 179
  year: 1998
  ident: 10.1016/S0304-3975(02)00009-9_BIB4
  article-title: Language complexity of rotations and Sturmian sequences
  publication-title: Theoret. Comput. Sci.
  doi: 10.1016/S0304-3975(97)00105-9
  contributor:
    fullname: Blanchard
– volume: 164
  start-page: 165
  year: 1996
  ident: 10.1016/S0304-3975(02)00009-9_BIB6
  article-title: Propriétés combinatoires des suites défines par billard dans les triangles pavants
  publication-title: Theoret. Comput. Sci.
  doi: 10.1016/0304-3975(95)00208-1
  contributor:
    fullname: Hubert
– volume: 44
  start-page: 103
  year: 1998
  ident: 10.1016/S0304-3975(02)00009-9_BIB1
  article-title: Three distance theorems and combinatorics on words
  publication-title: Enseig. Math.
  contributor:
    fullname: Alessandri
– volume: 46
  start-page: 196
  year: 1994
  ident: 10.1016/S0304-3975(02)00009-9_BIB7
  article-title: Sequences with subword complexity 2n
  publication-title: J. Number Theory
  doi: 10.1006/jnth.1994.1012
  contributor:
    fullname: Rote
SSID ssj0000576
Score 1.7533271
Snippet We show that the coding of a rotation by α on m intervals can be recoded over m Sturmian words of angle α.
A proof is presented to show that the coding of a rotation by alpha on m intervals can be recoded over m Sturmian words on angle alpha . The coding of...
SourceID hal
proquest
crossref
pascalfrancis
elsevier
SourceType Open Access Repository
Aggregation Database
Index Database
Publisher
StartPage 99
SubjectTerms Applied sciences
Computer Science
Computer science; control theory; systems
Data processing. List processing. Character string processing
Data Structures and Algorithms
Exact sciences and technology
Memory organisation. Data processing
Software
Title Coding rotations on intervals
URI https://dx.doi.org/10.1016/S0304-3975(02)00009-9
https://search.proquest.com/docview/27049734
https://hal.science/hal-00619502
Volume 281
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LT8MwDLYYu4AQb8R4jApxgENZmzZLchwT08aACw_tFnVtInZpJzY48tux-2BCCCFxqmQpaWQn9ufYsQHOVEJ15ZRwrfBjl6qBuGNPhm4SI7xGuCG4Tw-F7-7b_afwZsRHS9Ct3sJQWmWp-wudnmvrktIqudmaTiatBwrqoTXlHiuATg3qDNEvns565-p5eLtQyFwUIUsKAuCAxUOeYpKceO6xi3weV_1momovlCu5No1myD5b9L34ocJzu9TbhPUSUDqdYs1bsGTSbdiomjU45dndhtW7rwKtsx047mZktJzXrAjFz5wsdSZ5_iPux1146l0_dvtu2SnBjdH_m7vKCstM2yhuuAwiIWIeJWGbCWkE-QQI0tAM-ZEvZMxYhCjL0F2tQQfVt-Sm7sFymqVmH5wwQmdZWhVYLww5HyuWsCSQAoVqI0_aBlxWzNHToiCGXmSKITc1cVN7TOfc1KoBsmKh_iZZjUr7r6GnyPKv31Al7H7nVhONoJdC0b_7DWh-k8hiVYFAPNSWDTipRKTx7FBAJEpN9jbTTKB_JILw4P9LPISVvD8M3csER7A8f30zxwhT5uMm1C4__Ga5Gek7GPbvkToYXX0Cw8DfFA
link.rule.ids 230,315,783,787,888,3513,4509,24128,27581,27936,27937,45597,45675,45691,45886
linkProvider Elsevier
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LT8MwDLbYOABCPAaI8lqFOMChW5u2S3JEE2jAtgtD4hZ1bSJ2aSc2OPLbsfvYNCGExDVq0-hzYn-uHRvgSiZUV05yx3AvdqgaiDN2ReAkMdJrpBs89Oii8GDY6b0Ej6_h6xp0q7swlFZZ6v5Cp-fauhxpl2i2p5NJ-5mCemhNQ5cVRKcG6wHxY9zUra9lngcSkiJgSSEAfHx5jaeYIh-8dtlNPosjfzNQtTfKlNyeRjMEzxRdL34o8Nwq3e_BTkkn7dtixfuwptMG7FatGuzy5DZga7Aozzo7gPNuRibLfs-KQPzMzlJ7kmc_4m48hJf7u1G355R9EpwYvb-5Iw03THe0DHUo_IjzOIySoMO40Jw8AqRoaIS8yOMiZixCjqXpT61G99Qz5KQeQT3NUn0MdhChqyyM9I0bIJhjyRKW-IKjSE3kCmNBqwJHTYtyGGqZJ4ZoKkJTuUzlaCppgaggVCtyVaiy_3r1EiFffIbqYPdu-4rGiHhJFPynZ8HFikSWq_I5sqGOsKBZiUjhyaFwSJTq7GOmGEfviPvByf-X2ISN3mjQV_2H4dMpbOadYugPjX8G9fn7hz5HwjIfX-Qb8ht06t1L
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Coding+rotations+on+intervals&rft.jtitle=Theoretical+computer+science&rft.au=Berstel%2C+Jean&rft.au=Vuillon%2C+Laurent&rft.date=2002-06-03&rft.issn=0304-3975&rft.volume=281&rft.issue=1-2&rft.spage=99&rft.epage=107&rft_id=info:doi/10.1016%2FS0304-3975%2802%2900009-9&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0304-3975&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0304-3975&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0304-3975&client=summon