Quasiperiodic Sturmian words and morphisms
We characterize all quasiperiodic Sturmian words: A Sturmian word is not quasiperiodic if and only if it is a Lyndon word. Moreover, we study links between Sturmian morphisms and quasiperiodicity.
Gespeichert in:
| Veröffentlicht in: | Theoretical computer science 2007-03, Vol.372 (1), p.15-25 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 25 |
|---|---|
| container_issue | 1 |
| container_start_page | 15 |
| container_title | Theoretical computer science |
| container_volume | 372 |
| creator | Levé, F. Richomme, G. |
| description | We characterize all quasiperiodic Sturmian words: A Sturmian word is not quasiperiodic if and only if it is a Lyndon word. Moreover, we study links between Sturmian morphisms and quasiperiodicity. |
| doi_str_mv | 10.1016/j.tcs.2006.10.034 |
| format | Article |
| fullrecord | <record><control><sourceid>elsevier_hal_p</sourceid><recordid>TN_cdi_hal_primary_oai_HAL_hal_00016679v1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0304397506008590</els_id><sourcerecordid>S0304397506008590</sourcerecordid><originalsourceid>FETCH-LOGICAL-c404t-53e9406c27cf3fa4ff5eff8c3c0f81ff23134426417c5752970f7d5744bbe9303</originalsourceid><addsrcrecordid>eNp9UE1LAzEQDaJgrf4Ab3vxoLDr5HsXT0XUCgUR9RzSbEJTuh8k24r_3iwrenMuwzzeezPzELrEUGDA4nZbDCYWBECkuQDKjtAMl7LKCanYMZoBBZbTSvJTdBbjFlJxKWbo5nWvo-9t8F3tTfY27EPjdZt9dqGOmW7rrOlCv_GxiefoxOldtBc_fY4-Hh_e75f56uXp-X6xyg0DNuSc2oqBMEQaR51mznHrXGmoAVdi5wjFlDEiGJaGS04qCU7WXDK2XtuKAp2j68l3o3eqD77R4Ut12qvlYqVGLN2OhZDVAScunrgmdDEG634FGNQYjNqqFIwagxmhFEzSXE2aXkejdy7o1vj4Jyy5oBxG77uJZ9OzB2-Disbb1tjaB2sGVXf-ny3fFPl2ig</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Quasiperiodic Sturmian words and morphisms</title><source>Access via ScienceDirect (Elsevier)</source><source>EZB-FREE-00999 freely available EZB journals</source><creator>Levé, F. ; Richomme, G.</creator><creatorcontrib>Levé, F. ; Richomme, G.</creatorcontrib><description>We characterize all quasiperiodic Sturmian words: A Sturmian word is not quasiperiodic if and only if it is a Lyndon word. Moreover, we study links between Sturmian morphisms and quasiperiodicity.</description><identifier>ISSN: 0304-3975</identifier><identifier>EISSN: 1879-2294</identifier><identifier>DOI: 10.1016/j.tcs.2006.10.034</identifier><identifier>CODEN: TCSCDI</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Algorithmics. Computability. Computer arithmetics ; Applied sciences ; Computer Science ; Computer science; control theory; systems ; Discrete Mathematics ; Exact sciences and technology ; Language theory and syntactical analysis ; Lyndon words ; Morphisms ; Quasiperiodicity ; Sturmian words ; Theoretical computing</subject><ispartof>Theoretical computer science, 2007-03, Vol.372 (1), p.15-25</ispartof><rights>2006 Elsevier Ltd</rights><rights>2007 INIST-CNRS</rights><rights>Distributed under a Creative Commons Attribution 4.0 International License</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c404t-53e9406c27cf3fa4ff5eff8c3c0f81ff23134426417c5752970f7d5744bbe9303</citedby><cites>FETCH-LOGICAL-c404t-53e9406c27cf3fa4ff5eff8c3c0f81ff23134426417c5752970f7d5744bbe9303</cites><orcidid>0000-0003-2211-7448 ; 0000-0002-6571-5096</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.tcs.2006.10.034$$EHTML$$P50$$Gelsevier$$Hfree_for_read</linktohtml><link.rule.ids>230,314,780,784,885,3550,27924,27925,45995</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=18563501$$DView record in Pascal Francis$$Hfree_for_read</backlink><backlink>$$Uhttps://hal.science/hal-00016679$$DView record in HAL$$Hfree_for_read</backlink></links><search><creatorcontrib>Levé, F.</creatorcontrib><creatorcontrib>Richomme, G.</creatorcontrib><title>Quasiperiodic Sturmian words and morphisms</title><title>Theoretical computer science</title><description>We characterize all quasiperiodic Sturmian words: A Sturmian word is not quasiperiodic if and only if it is a Lyndon word. Moreover, we study links between Sturmian morphisms and quasiperiodicity.</description><subject>Algorithmics. Computability. Computer arithmetics</subject><subject>Applied sciences</subject><subject>Computer Science</subject><subject>Computer science; control theory; systems</subject><subject>Discrete Mathematics</subject><subject>Exact sciences and technology</subject><subject>Language theory and syntactical analysis</subject><subject>Lyndon words</subject><subject>Morphisms</subject><subject>Quasiperiodicity</subject><subject>Sturmian words</subject><subject>Theoretical computing</subject><issn>0304-3975</issn><issn>1879-2294</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2007</creationdate><recordtype>article</recordtype><recordid>eNp9UE1LAzEQDaJgrf4Ab3vxoLDr5HsXT0XUCgUR9RzSbEJTuh8k24r_3iwrenMuwzzeezPzELrEUGDA4nZbDCYWBECkuQDKjtAMl7LKCanYMZoBBZbTSvJTdBbjFlJxKWbo5nWvo-9t8F3tTfY27EPjdZt9dqGOmW7rrOlCv_GxiefoxOldtBc_fY4-Hh_e75f56uXp-X6xyg0DNuSc2oqBMEQaR51mznHrXGmoAVdi5wjFlDEiGJaGS04qCU7WXDK2XtuKAp2j68l3o3eqD77R4Ut12qvlYqVGLN2OhZDVAScunrgmdDEG634FGNQYjNqqFIwagxmhFEzSXE2aXkejdy7o1vj4Jyy5oBxG77uJZ9OzB2-Disbb1tjaB2sGVXf-ny3fFPl2ig</recordid><startdate>20070306</startdate><enddate>20070306</enddate><creator>Levé, F.</creator><creator>Richomme, G.</creator><general>Elsevier B.V</general><general>Elsevier</general><scope>6I.</scope><scope>AAFTH</scope><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>1XC</scope><scope>VOOES</scope><orcidid>https://orcid.org/0000-0003-2211-7448</orcidid><orcidid>https://orcid.org/0000-0002-6571-5096</orcidid></search><sort><creationdate>20070306</creationdate><title>Quasiperiodic Sturmian words and morphisms</title><author>Levé, F. ; Richomme, G.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c404t-53e9406c27cf3fa4ff5eff8c3c0f81ff23134426417c5752970f7d5744bbe9303</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2007</creationdate><topic>Algorithmics. Computability. Computer arithmetics</topic><topic>Applied sciences</topic><topic>Computer Science</topic><topic>Computer science; control theory; systems</topic><topic>Discrete Mathematics</topic><topic>Exact sciences and technology</topic><topic>Language theory and syntactical analysis</topic><topic>Lyndon words</topic><topic>Morphisms</topic><topic>Quasiperiodicity</topic><topic>Sturmian words</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Levé, F.</creatorcontrib><creatorcontrib>Richomme, G.</creatorcontrib><collection>ScienceDirect Open Access Titles</collection><collection>Elsevier:ScienceDirect:Open Access</collection><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Hyper Article en Ligne (HAL)</collection><collection>Hyper Article en Ligne (HAL) (Open Access)</collection><jtitle>Theoretical computer science</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Levé, F.</au><au>Richomme, G.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Quasiperiodic Sturmian words and morphisms</atitle><jtitle>Theoretical computer science</jtitle><date>2007-03-06</date><risdate>2007</risdate><volume>372</volume><issue>1</issue><spage>15</spage><epage>25</epage><pages>15-25</pages><issn>0304-3975</issn><eissn>1879-2294</eissn><coden>TCSCDI</coden><abstract>We characterize all quasiperiodic Sturmian words: A Sturmian word is not quasiperiodic if and only if it is a Lyndon word. Moreover, we study links between Sturmian morphisms and quasiperiodicity.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/j.tcs.2006.10.034</doi><tpages>11</tpages><orcidid>https://orcid.org/0000-0003-2211-7448</orcidid><orcidid>https://orcid.org/0000-0002-6571-5096</orcidid><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0304-3975 |
| ispartof | Theoretical computer science, 2007-03, Vol.372 (1), p.15-25 |
| issn | 0304-3975 1879-2294 |
| language | eng |
| recordid | cdi_hal_primary_oai_HAL_hal_00016679v1 |
| source | Access via ScienceDirect (Elsevier); EZB-FREE-00999 freely available EZB journals |
| subjects | Algorithmics. Computability. Computer arithmetics Applied sciences Computer Science Computer science control theory systems Discrete Mathematics Exact sciences and technology Language theory and syntactical analysis Lyndon words Morphisms Quasiperiodicity Sturmian words Theoretical computing |
| title | Quasiperiodic Sturmian words and morphisms |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-28T20%3A51%3A41IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-elsevier_hal_p&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Quasiperiodic%20Sturmian%20words%20and%20morphisms&rft.jtitle=Theoretical%20computer%20science&rft.au=Lev%C3%A9,%20F.&rft.date=2007-03-06&rft.volume=372&rft.issue=1&rft.spage=15&rft.epage=25&rft.pages=15-25&rft.issn=0304-3975&rft.eissn=1879-2294&rft.coden=TCSCDI&rft_id=info:doi/10.1016/j.tcs.2006.10.034&rft_dat=%3Celsevier_hal_p%3ES0304397506008590%3C/elsevier_hal_p%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_els_id=S0304397506008590&rfr_iscdi=true |