<?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-04284389</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-05-03T14:09:17+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Domino Snake Problems on Groups</title>
            <author role="aut">
              <persName>
                <forename type="first">Nathalie</forename>
                <surname>Aubrun</surname>
              </persName>
              <email type="md5">b3dbb77d4294958b1d6d0f3f432270bd</email>
              <email type="domain">gmail.com</email>
              <idno type="idhal" notation="string">nathalieaubrun</idno>
              <idno type="idhal" notation="numeric">8859</idno>
              <idno type="halauthorid" notation="string">13208-8859</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-2701-570X</idno>
              <idno type="IDREF">https://www.idref.fr/158034643</idno>
              <idno type="VIAF">https://viaf.org/viaf/309907142</idno>
              <affiliation ref="#struct-1062147"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Nicolas</forename>
                <surname>Bitar</surname>
              </persName>
              <email type="md5">de6cac2d158765267fbc51189d8e8d24</email>
              <email type="domain">gmail.com</email>
              <idno type="idhal" notation="string">nicolas-bitar</idno>
              <idno type="idhal" notation="numeric">754121</idno>
              <idno type="halauthorid" notation="string">2952574-754121</idno>
              <idno type="ARXIV">https://arxiv.org/a/http://arxiv.org/a/bitar_n_1</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-3460-9442</idno>
              <idno type="IDREF">https://www.idref.fr/279223625</idno>
              <affiliation ref="#struct-1062147"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Nathalie</forename>
                <surname>Aubrun</surname>
              </persName>
              <email type="md5">b3dbb77d4294958b1d6d0f3f432270bd</email>
              <email type="domain">gmail.com</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2023-11-14 12:11:44</date>
              <date type="whenModified">2026-01-12 10:53:43</date>
              <date type="whenReleased">2023-11-14 12:11:44</date>
              <date type="whenProduced">2023-09-18</date>
              <ref type="externalLink" target="http://arxiv.org/pdf/2307.12655"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="16262">
                <persName>
                  <forename>Nathalie</forename>
                  <surname>Aubrun</surname>
                </persName>
                <email type="md5">b3dbb77d4294958b1d6d0f3f432270bd</email>
                <email type="domain">gmail.com</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-04284389</idno>
            <idno type="halUri">https://hal.science/hal-04284389</idno>
            <idno type="halBibtex">aubrun:hal-04284389</idno>
            <idno type="halRefHtml">&lt;i&gt;Fundamentals of Computation Theory&lt;/i&gt;, Sep 2023, Trier, Germany. pp.46-59, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-031-43587-4_4"&gt;&amp;#x27E8;10.1007/978-3-031-43587-4_4&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Fundamentals of Computation Theory, Sep 2023, Trier, Germany. pp.46-59, &amp;#x27E8;10.1007/978-3-031-43587-4_4&amp;#x27E9;</idno>
            <availability status="restricted"/>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="CENTRALESUPELEC">Ecole CentraleSupélec</idno>
            <idno type="stamp" n="UNIV-PARIS-SACLAY">Université Paris-Saclay</idno>
            <idno type="stamp" n="UNIVERSITE-PARIS-SACLAY" corresp="UNIV-PARIS-SACLAY">Université Paris-Saclay</idno>
            <idno type="stamp" n="LISN">Laboratoire Interdisciplinaire des Sciences du Numérique</idno>
            <idno type="stamp" n="GS-COMPUTER-SCIENCE">Graduate School Computer Science</idno>
            <idno type="stamp" n="LISN-GALAC" corresp="LISN">Graphes, Algorithmes et Combinatoire </idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="invited" n="0">No</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
            <note type="proceedings" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Domino Snake Problems on Groups</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Nathalie</forename>
                    <surname>Aubrun</surname>
                  </persName>
                  <email type="md5">b3dbb77d4294958b1d6d0f3f432270bd</email>
                  <email type="domain">gmail.com</email>
                  <idno type="idhal" notation="string">nathalieaubrun</idno>
                  <idno type="idhal" notation="numeric">8859</idno>
                  <idno type="halauthorid" notation="string">13208-8859</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-2701-570X</idno>
                  <idno type="IDREF">https://www.idref.fr/158034643</idno>
                  <idno type="VIAF">https://viaf.org/viaf/309907142</idno>
                  <affiliation ref="#struct-1062147"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Nicolas</forename>
                    <surname>Bitar</surname>
                  </persName>
                  <email type="md5">de6cac2d158765267fbc51189d8e8d24</email>
                  <email type="domain">gmail.com</email>
                  <idno type="idhal" notation="string">nicolas-bitar</idno>
                  <idno type="idhal" notation="numeric">754121</idno>
                  <idno type="halauthorid" notation="string">2952574-754121</idno>
                  <idno type="ARXIV">https://arxiv.org/a/http://arxiv.org/a/bitar_n_1</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-3460-9442</idno>
                  <idno type="IDREF">https://www.idref.fr/279223625</idno>
                  <affiliation ref="#struct-1062147"/>
                </author>
              </analytic>
              <monogr>
                <idno type="isbn">978-3-031-43587-4</idno>
                <title level="m">Fundamentals of Computation Theory24th International Symposium, FCT 2023, Trier, Germany, September 18–21, 2023, Proceedings</title>
                <meeting>
                  <title>Fundamentals of Computation Theory</title>
                  <date type="start">2023-09-18</date>
                  <date type="end">2023-09-21</date>
                  <settlement>Trier</settlement>
                  <country key="DE">Germany</country>
                </meeting>
                <imprint>
                  <publisher>Springer Nature Switzerland</publisher>
                  <pubPlace>Cham</pubPlace>
                  <biblScope unit="serie">Lecture Notes in Computer Science</biblScope>
                  <biblScope unit="volume">14292</biblScope>
                  <biblScope unit="pp">46-59</biblScope>
                  <date type="datePub">2023-09-21</date>
                </imprint>
              </monogr>
              <idno type="arxiv">2307.12655</idno>
              <idno type="doi">10.1007/978-3-031-43587-4_4</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Domino Snake Problems</term>
                <term xml:lang="en">Computability Theory</term>
                <term xml:lang="en">Symbolic Dynamics</term>
                <term xml:lang="en">Combinatorial Group Theory</term>
                <term xml:lang="en">MSO logic</term>
              </keywords>
              <classCode scheme="halDomain" n="info">Computer Science [cs]</classCode>
              <classCode scheme="halTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halOldTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halTreeTypology" n="COMM">Conference papers</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>In this article we study domino snake problems on finitely generated groups. We provide general properties of these problems and introduce new tools for their study. The first is the use of symbolic dynamics to understand the set of all possible snakes. Using this approach we solve many variations of the infinite snake problem including the geodesic snake problem for certain classes of groups. Next, we introduce a notion of embedding that allows us to reduce the decidability of snake problems from one group to another. This notion enable us to establish the undecidability of the infinite snake and ouroboros problems on nilpotent groups for any generating set, given that we add a well-chosen element. Finally, we make use of monadic second order logic to prove that domino snake problems are decidable on virtually free groups for all generating sets.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="researchteam" xml:id="struct-1062147" status="VALID">
          <orgName>Graphes, Algorithmes et Combinatoire - LISN</orgName>
          <orgName type="acronym">GALaC</orgName>
          <date type="start">2021-01-01</date>
          <desc>
            <address>
              <addrLine>Université Paris-Saclay, Bâtiment 650, 91190 Gif-sur-Yvette</addrLine>
              <country key="FR"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-1061259" type="direct"/>
            <relation active="#struct-300009" type="indirect"/>
            <relation active="#struct-411575" type="indirect"/>
            <relation active="#struct-419361" type="indirect"/>
            <relation name="UMR9015" active="#struct-441569" type="indirect"/>
            <relation active="#struct-1065373" type="direct"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-1061259" status="VALID">
          <idno type="IdRef">253160316</idno>
          <idno type="RNSR">202123711L</idno>
          <idno type="ROR">https://ror.org/00rd81916</idno>
          <idno type="Wikidata">Q109620676</idno>
          <orgName>Laboratoire Interdisciplinaire des Sciences du Numérique</orgName>
          <orgName type="acronym">LISN</orgName>
          <date type="start">2021-01-01</date>
          <desc>
            <address>
              <addrLine>Campus Universitaire bât 507Rue du Belvédère91405 Orsay cedexet Campus Universitaire bât 6401 rue Raimond Castaing91190 Gif-sur-Yvette</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.lisn.upsaclay.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" type="direct"/>
            <relation active="#struct-411575" type="direct"/>
            <relation active="#struct-419361" type="direct"/>
            <relation name="UMR9015" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300009" status="VALID">
          <idno type="ROR">https://ror.org/02kvxyf05</idno>
          <orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
          <orgName type="acronym">Inria</orgName>
          <desc>
            <address>
              <addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/en/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-411575" status="VALID">
          <idno type="IdRef">184443237</idno>
          <idno type="ROR">https://ror.org/019tcpt25</idno>
          <orgName>CentraleSupélec</orgName>
          <desc>
            <address>
              <addrLine>3, rue Joliot Curie,Plateau de Moulon,91192 GIF-SUR-YVETTE Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.centralesupelec.fr</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-419361" status="VALID">
          <idno type="IdRef">241345251</idno>
          <idno type="ROR">https://ror.org/03xjwb503</idno>
          <orgName>Université Paris-Saclay</orgName>
          <desc>
            <address>
              <addrLine>Bâtiment Bréguet, 3 Rue Joliot Curie 2e ét, 91190 Gif-sur-Yvette</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.universite-paris-saclay.fr/fr</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-441569" status="VALID">
          <idno type="IdRef">02636817X</idno>
          <idno type="ISNI">0000000122597504</idno>
          <idno type="ROR">https://ror.org/02feahw73</idno>
          <orgName>Centre National de la Recherche Scientifique</orgName>
          <orgName type="acronym">CNRS</orgName>
          <date type="start">1939-10-19</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.cnrs.fr/</ref>
          </desc>
        </org>
        <org type="department" xml:id="struct-1065373" status="VALID">
          <orgName>Algorithmes, Apprentissage et Calcul</orgName>
          <orgName type="acronym">AAC</orgName>
          <date type="start">2021-01-01</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-1061259" type="direct"/>
            <relation active="#struct-300009" type="indirect"/>
            <relation active="#struct-411575" type="indirect"/>
            <relation active="#struct-419361" type="indirect"/>
            <relation name="UMR9015" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>