<?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-05144842</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-24T03:39:33+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Using games and universal trees to characterise the nondeterministic index of tree languages</title>
            <author role="aut">
              <persName>
                <forename type="first">Olivier</forename>
                <surname>Idir</surname>
              </persName>
              <idno type="halauthorid">2600605-0</idno>
              <affiliation ref="#struct-1005016"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Karoliina</forename>
                <surname>Lehtinen</surname>
              </persName>
              <email type="md5">d027e31893b36cb37e65a504ce2556e2</email>
              <email type="domain">lis-lab.fr</email>
              <idno type="idhal" notation="string">karoliina-lehtinen</idno>
              <idno type="idhal" notation="numeric">1188830</idno>
              <idno type="halauthorid" notation="string">2098930-1188830</idno>
              <affiliation ref="#struct-530003"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Karoliina</forename>
                <surname>Lehtinen</surname>
              </persName>
              <email type="md5">d027e31893b36cb37e65a504ce2556e2</email>
              <email type="domain">lis-lab.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2025-07-04 15:33:33</date>
              <date type="whenModified">2026-04-22 09:38:21</date>
              <date type="whenReleased">2025-07-07 08:13:07</date>
              <date type="whenProduced">2025</date>
              <date type="whenEndEmbargoed">2025-07-04</date>
              <ref type="file" target="https://hal.science/hal-05144842v1/document">
                <date notBefore="2025-07-04"/>
              </ref>
              <ref type="file" subtype="greenPublisher" n="1" target="https://hal.science/hal-05144842v1/file/2504.16819v2.pdf" id="file-5144842-4443997">
                <date notBefore="2025-07-04"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="706176">
                <persName>
                  <forename>Karoliina</forename>
                  <surname>Lehtinen</surname>
                </persName>
                <email type="md5">d027e31893b36cb37e65a504ce2556e2</email>
                <email type="domain">lis-lab.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-05144842</idno>
            <idno type="halUri">https://hal.science/hal-05144842</idno>
            <idno type="halBibtex">idir:hal-05144842</idno>
            <idno type="halRefHtml">&lt;i&gt;52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025)&lt;/i&gt;, 2025, Aarhus (Danemark), Denmark. &lt;a target="_blank" href="https://dx.doi.org/10.4230/LIPIcs.ICALP.2025.160"&gt;&amp;#x27E8;10.4230/LIPIcs.ICALP.2025.160&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025), 2025, Aarhus (Danemark), Denmark. &amp;#x27E8;10.4230/LIPIcs.ICALP.2025.160&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://creativecommons.org/licenses/by/4.0/">CC BY 4.0 - Attribution<ref corresp="#file-5144842-4443997"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UNIV-TLN">Université de Toulon</idno>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="UNIV-AMU">Aix Marseille Université</idno>
            <idno type="stamp" n="LIS-LAB">Laboratoire d'Informatique et Systèmes</idno>
            <idno type="stamp" n="MOVE" corresp="LIS-LAB">MOVE Modélisation et Vérification - LIS Laboratoire d'Informatique et Systèmes de Marseille (UMR 7020)</idno>
            <idno type="stamp" n="UNIV-PARIS">Université Paris Cité</idno>
            <idno type="stamp" n="UNIVERSITE-PARIS" corresp="UNIV-PARIS">Université Paris Cité</idno>
            <idno type="stamp" n="UP-SCIENCES">Université Paris Cité - Faculté des Sciences</idno>
            <idno type="stamp" n="IRIF">Institut de Recherche en Informatique Fondamentale</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">Using games and universal trees to characterise the nondeterministic index of tree languages</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Olivier</forename>
                    <surname>Idir</surname>
                  </persName>
                  <idno type="halauthorid">2600605-0</idno>
                  <affiliation ref="#struct-1005016"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Karoliina</forename>
                    <surname>Lehtinen</surname>
                  </persName>
                  <email type="md5">d027e31893b36cb37e65a504ce2556e2</email>
                  <email type="domain">lis-lab.fr</email>
                  <idno type="idhal" notation="string">karoliina-lehtinen</idno>
                  <idno type="idhal" notation="numeric">1188830</idno>
                  <idno type="halauthorid" notation="string">2098930-1188830</idno>
                  <affiliation ref="#struct-530003"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025)</title>
                <meeting>
                  <title>52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025)</title>
                  <date type="start">2025</date>
                  <settlement>Aarhus (Danemark)</settlement>
                  <country key="DK">Denmark</country>
                </meeting>
                <imprint>
                  <publisher>arXiv</publisher>
                  <date type="datePub">2025</date>
                </imprint>
              </monogr>
              <idno type="doi">10.4230/LIPIcs.ICALP.2025.160</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Parity tree automata</term>
                <term xml:lang="en">attractor decomposition</term>
                <term xml:lang="en">Strahler number</term>
                <term xml:lang="en">Mostowski index</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>The parity index problem of tree automata asks, given a regular tree language $L$ and a set of priorities $J$, is $L$ $J$-feasible, that is, recognised by a nondeterministic parity automaton with priorities $J$? This is a long-standing open problem, of which only a few sub-cases and variations are known to be decidable. In a significant but technically difficult step, Colcombet and Löding reduced the problem to the uniform universality of distance-parity automata. In this article, we revisit the index problem using tools from the parity game literature. We add some counters to Lehtinen's register game, originally used to solve parity games in quasipolynomial time, and use this novel game to characterise $J$-feasibility. This provides a alternative proof to Colcombet and Löding's reduction. We then provide a second characterisation, based on the notion of attractor decompositions and the complexity of their structure, as measured by a parameterised version of their Strahler number, which we call $n$-Strahler number. Finally, we rephrase this result using the notion of universal tree extended to automata: a guidable automaton recognises a $[1,2j]$-feasible language if and only if it admits a universal tree with $n$-Strahler number $j$, for some $n$. In particular, a language recognised by a guidable automaton $A$ is Büchi-feasible if and only if there is a uniform bound $n\in \mathbb{N}$ such that all trees in the language admit an accepting run with an attractor decomposition of width bounded by $n$, or, equivalently, if and only $A$ admits a \textit{finite} universal tree. While we do not solve the decidability of the index problem, our work makes the state-of-the-art more accessible and brings to light the deep relationships between the $J$-feasibility of a language and attractor decompositions, universal trees and Lehtinen's register game.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-1005016" status="VALID">
          <idno type="IdRef">193993007</idno>
          <idno type="RNSR">201621976X</idno>
          <idno type="ROR">https://ror.org/02krdtz55</idno>
          <idno type="Wikidata">Q51783269</idno>
          <orgName>Institut de Recherche en Informatique Fondamentale</orgName>
          <orgName type="acronym">IRIF (UMR_8243)</orgName>
          <date type="start">2020-01-01</date>
          <desc>
            <address>
              <addrLine>Université Paris CitéBâtiment Sophie Germain, Case courrier 70148 Place Aurélie Nemours75205 Paris Cedex 13</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.irif.fr/</ref>
          </desc>
          <listRelation>
            <relation name="UMR8243" active="#struct-441569" type="direct"/>
            <relation name="UMR_8243" active="#struct-557826" type="direct"/>
          </listRelation>
        </org>
        <org type="researchteam" xml:id="struct-530003" status="VALID">
          <orgName>Modélisation et Vérification</orgName>
          <orgName type="acronym">MOVE</orgName>
          <desc>
            <address>
              <addrLine>Luminy</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lis-lab.fr/recherche/calcul/move</ref>
          </desc>
          <listRelation>
            <relation active="#struct-527033" type="direct"/>
            <relation name="UMR7020" active="#struct-198056" type="indirect"/>
            <relation name="UMR7020" active="#struct-303091" type="indirect"/>
            <relation name="UMR7020" active="#struct-441569" type="indirect"/>
          </listRelation>
        </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="institution" xml:id="struct-557826" status="VALID">
          <idno type="IdRef">236453505</idno>
          <idno type="ISNI">0000 0004 7885 7602</idno>
          <idno type="ROR">https://ror.org/05f82e368</idno>
          <orgName>Université Paris Cité</orgName>
          <orgName type="acronym">UPCité</orgName>
          <date type="start">2020-01-01</date>
          <desc>
            <address>
              <addrLine>85 boulevard Saint-Germain75006 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://u-paris.fr/</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-527033" status="VALID">
          <idno type="IdRef">234768002</idno>
          <idno type="RNSR">201822714R</idno>
          <idno type="ROR">https://ror.org/0257sgk90</idno>
          <idno type="Wikidata">Q52605252</idno>
          <orgName>Laboratoire d'Informatique et des Systèmes (LIS) (Marseille, Toulon)</orgName>
          <orgName type="acronym">LIS</orgName>
          <date type="start">2018-01-01</date>
          <desc>
            <address>
              <addrLine>Aix Marseille Université – Campus de Saint Jérôme – Bat. Polytech, 52 Av. Escadrille Normandie Niemen, 13397 Marseille Cedex 20</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lis-lab.fr</ref>
          </desc>
          <listRelation>
            <relation name="UMR7020" active="#struct-198056" type="direct"/>
            <relation name="UMR7020" active="#struct-303091" type="direct"/>
            <relation name="UMR7020" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-198056" status="VALID">
          <idno type="IdRef">15863621X</idno>
          <idno type="ISNI">0000 0001 2176 4817</idno>
          <idno type="ROR">https://ror.org/035xkbk20</idno>
          <orgName>Aix Marseille Université</orgName>
          <orgName type="acronym">AMU</orgName>
          <date type="start">2012-01-01</date>
          <desc>
            <address>
              <addrLine>Aix-Marseille UniversitéJardins du Pharo58 Boulevard Charles Livon13284 Marseille cedex 7</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-amu.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-303091" status="VALID">
          <idno type="IdRef">031122337</idno>
          <idno type="ROR">https://ror.org/02m9kbe37</idno>
          <orgName>Université de Toulon</orgName>
          <orgName type="acronym">UTLN</orgName>
          <desc>
            <address>
              <addrLine>Avenue de l'Université - BP 20132 - 83957 La Garde Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-tln.fr/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>