<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-00958967</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-04-24T22:01:25+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Overlap-free symmetric D0L words</title>
            <author role="aut">
              <persName>
                <forename type="first">Anna</forename>
                <surname>Frid</surname>
              </persName>
              <idno type="halauthorid">735703-0</idno>
              <affiliation ref="#struct-82743"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Service Ist</forename>
                <surname>Inria Sophia Antipolis-Méditerranée / I3s</surname>
              </persName>
              <email type="md5">7c88c2dda46d455591481b4e07aef779</email>
              <email type="domain">inria.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2014-03-13 16:53:52</date>
              <date type="whenModified">2023-02-07 03:42:38</date>
              <date type="whenReleased">2014-03-13 21:14:05</date>
              <date type="whenProduced">2001-01-01</date>
              <date type="whenEndEmbargoed">2014-03-13</date>
              <ref type="file" target="https://inria.hal.science/hal-00958967v1/document">
                <date notBefore="2014-03-13"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-00958967v1/file/dm040220.pdf" id="file-958967-572505">
                <date notBefore="2014-03-13"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="129574">
                <persName>
                  <forename>Service Ist</forename>
                  <surname>Inria Sophia Antipolis-Méditerranée / I3s</surname>
                </persName>
                <email type="md5">7c88c2dda46d455591481b4e07aef779</email>
                <email type="domain">inria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-00958967</idno>
            <idno type="halUri">https://inria.hal.science/hal-00958967</idno>
            <idno type="halBibtex">frid:hal-00958967</idno>
            <idno type="halRefHtml">&lt;i&gt;Discrete Mathematics and Theoretical Computer Science&lt;/i&gt;, 2001, Vol. 4 no. 2 (2), pp.357-362. &lt;a target="_blank" href="https://dx.doi.org/10.46298/dmtcs.293"&gt;&amp;#x27E8;10.46298/dmtcs.293&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Discrete Mathematics and Theoretical Computer Science, 2001, Vol. 4 no. 2 (2), pp.357-362. &amp;#x27E8;10.46298/dmtcs.293&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-958967-572505"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="DMTCS">DMTCS</idno>
            <idno type="stamp" n="TDS-MACS">Réseau de recherche en Théorie des Systèmes Distribués, Modélisation, Analyse et Contrôle des Systèmes</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Overlap-free symmetric D0L words</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Anna</forename>
                    <surname>Frid</surname>
                  </persName>
                  <idno type="halauthorid">735703-0</idno>
                  <affiliation ref="#struct-82743"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">649</idno>
                <idno type="issn">1462-7264</idno>
                <idno type="eissn">1365-8050</idno>
                <title level="j">Discrete Mathematics and Theoretical Computer Science</title>
                <imprint>
                  <publisher>DMTCS</publisher>
                  <biblScope unit="volume">Vol. 4 no. 2</biblScope>
                  <biblScope unit="issue">2</biblScope>
                  <biblScope unit="pp">357-362</biblScope>
                  <date type="datePub">2001-01-01</date>
                </imprint>
              </monogr>
              <idno type="doi">10.46298/dmtcs.293</idno>
              <ref target="http://www.dmtcs.org/volumes/abstracts/dm040220.abs.html" type="seeAlso"/>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">overlap-free word</term>
                <term xml:lang="en">D0L word</term>
                <term xml:lang="en">symmetric morphism</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-dm">Computer Science [cs]/Discrete Mathematics [cs.DM]</classCode>
              <classCode scheme="halTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halOldTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halTreeTypology" n="ART">Journal articles</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>A D0L word on an alphabet Σ =\0,1,\ldots,q-1\ is called symmetric if it is a fixed point w=\varphi(w) of a morphism \varphi:Σ ^* → Σ ^* defined by \varphi(i)=øverlinet_1 + i øverlinet_2 + i\ldots øverlinet_m + i for some word t_1t_2\ldots t_m (equal to \varphi(0)) and every i ∈ Σ ; here øverlinea means a \bmod q. We prove a result conjectured by J. Shallit: if all the symbols in \varphi(0) are distinct (i.e., if t_i ≠q t_j for i ≠q j), then the symmetric D0L word w is overlap-free, i.e., contains no factor of the form axaxa for any x ∈ Σ ^* and a ∈ Σ .</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-82743" status="VALID">
          <orgName>Sobolev Institute of Mathematics</orgName>
          <desc>
            <address>
              <addrLine>4 Acad. Koptyug avenue, 630090 Novosibirsk Russia</addrLine>
              <country key="RU"/>
            </address>
            <ref type="url">http://www.math.nsc.ru/english.html</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300194" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300194" status="VALID">
          <idno type="ROR">https://ror.org/02frkq021</idno>
          <orgName>Siberian Branch of the Russian Academy of Sciences</orgName>
          <orgName type="acronym">SB RAS</orgName>
          <desc>
            <address>
              <addrLine>17, Ac. Lavrentieva ave., Novosibirsk, 630090</addrLine>
              <country key="RU"/>
            </address>
            <ref type="url">http://www.sbras.ru/en</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>