<?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-01408760</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-21T10:21:55+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Canonical Nondeterministic Automata</title>
            <author role="aut">
              <persName>
                <forename type="first">Robert</forename>
                <forename type="middle">R.</forename>
                <surname>Myers</surname>
              </persName>
              <idno type="halauthorid">1088968-0</idno>
              <affiliation ref="#struct-71839"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Jiří</forename>
                <surname>Adámek</surname>
              </persName>
              <idno type="halauthorid">1088969-0</idno>
              <affiliation ref="#struct-71839"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Stefan</forename>
                <surname>Milius</surname>
              </persName>
              <idno type="halauthorid">696027-0</idno>
              <affiliation ref="#struct-311714"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Henning</forename>
                <surname>Urbat</surname>
              </persName>
              <email type="md5">6047e588063ec89fdb5cccbced37937e</email>
              <email type="domain">iti.cs.tu-bs.de</email>
              <idno type="idhal" notation="numeric">995267</idno>
              <idno type="halauthorid" notation="string">1088970-995267</idno>
              <affiliation ref="#struct-71839"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Hal</forename>
                <surname>Ifip</surname>
              </persName>
              <email type="md5">2073ac78024b6e13f2714db96e9b1e63</email>
              <email type="domain">inria.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2016-12-05 13:25:37</date>
              <date type="whenModified">2023-10-12 11:48:05</date>
              <date type="whenReleased">2016-12-05 14:23:45</date>
              <date type="whenProduced">2014-04-05</date>
              <date type="whenEndEmbargoed">2017-01-01</date>
              <ref type="file" target="https://inria.hal.science/hal-01408760v1/document">
                <date notBefore="2017-01-01"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-01408760v1/file/328263_1_En_11_Chapter.pdf" id="file-1408760-1495344">
                <date notBefore="2017-01-01"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="200187">
                <persName>
                  <forename>Hal</forename>
                  <surname>Ifip</surname>
                </persName>
                <email type="md5">2073ac78024b6e13f2714db96e9b1e63</email>
                <email type="domain">inria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01408760</idno>
            <idno type="halUri">https://inria.hal.science/hal-01408760</idno>
            <idno type="halBibtex">myers:hal-01408760</idno>
            <idno type="halRefHtml">&lt;i&gt;12th International Workshop on Coalgebraic Methods in Computer Science (CMCS)&lt;/i&gt;, Apr 2014, Grenoble, France. pp.189-210, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-662-44124-4_11"&gt;&amp;#x27E8;10.1007/978-3-662-44124-4_11&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">12th International Workshop on Coalgebraic Methods in Computer Science (CMCS), Apr 2014, Grenoble, France. pp.189-210, &amp;#x27E8;10.1007/978-3-662-44124-4_11&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://creativecommons.org/licenses/by/4.0/">CC BY 4.0 - Attribution<ref corresp="#file-1408760-1495344"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="IFIP-LNCS" corresp="IFIP">IFIP - Lecture Notes in Computer Science</idno>
            <idno type="stamp" n="IFIP">IFIP - International Federation for Information Processing</idno>
            <idno type="stamp" n="IFIP-TC" corresp="IFIP">IFIP Technical Committees </idno>
            <idno type="stamp" n="IFIP-TC1" corresp="IFIP-TC">IFIP TC1: Foundations of Computer Science</idno>
            <idno type="stamp" n="IFIP-LNCS-8446" corresp="IFIP-LNCS">Coalgebraic Methods in Computer Science</idno>
            <idno type="stamp" n="IFIP-WG1-3">IFIP-WG1-3</idno>
            <idno type="stamp" n="IFIP-CMCS">IFIP-CMCS</idno>
          </seriesStmt>
          <notesStmt>
            <note type="commentary">Part 2: Regular Contributions</note>
            <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">Canonical Nondeterministic Automata</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Robert</forename>
                    <forename type="middle">R.</forename>
                    <surname>Myers</surname>
                  </persName>
                  <idno type="halauthorid">1088968-0</idno>
                  <affiliation ref="#struct-71839"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Jiří</forename>
                    <surname>Adámek</surname>
                  </persName>
                  <idno type="halauthorid">1088969-0</idno>
                  <affiliation ref="#struct-71839"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Stefan</forename>
                    <surname>Milius</surname>
                  </persName>
                  <idno type="halauthorid">696027-0</idno>
                  <affiliation ref="#struct-311714"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Henning</forename>
                    <surname>Urbat</surname>
                  </persName>
                  <email type="md5">6047e588063ec89fdb5cccbced37937e</email>
                  <email type="domain">iti.cs.tu-bs.de</email>
                  <idno type="idhal" notation="numeric">995267</idno>
                  <idno type="halauthorid" notation="string">1088970-995267</idno>
                  <affiliation ref="#struct-71839"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">Lecture Notes in Computer Science</title>
                <meeting>
                  <title>12th International Workshop on Coalgebraic Methods in Computer Science (CMCS)</title>
                  <date type="start">2014-04-05</date>
                  <date type="end">2014-04-06</date>
                  <settlement>Grenoble</settlement>
                  <country key="FR">France</country>
                </meeting>
                <editor>Marcello M. Bonsangue</editor>
                <imprint>
                  <biblScope unit="serie">Coalgebraic Methods in Computer Science</biblScope>
                  <biblScope unit="volume">LNCS-8446</biblScope>
                  <biblScope unit="pp">189-210</biblScope>
                  <date type="datePub">2014</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/978-3-662-44124-4_11</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <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>For each regular language &lt;math xmlns="http://www.w3.org/1998/Math/MathML"&gt;  &lt;mi&gt;L&lt;/mi&gt;&lt;/math&gt; we describe a family of canonical nondeterministic acceptors (nfas). Their construction follows a uniform recipe: build the minimal dfa for &lt;math xmlns="http://www.w3.org/1998/Math/MathML"&gt;  &lt;mi&gt;L&lt;/mi&gt;&lt;/math&gt; in a locally finite variety &lt;math xmlns="http://www.w3.org/1998/Math/MathML"&gt;  &lt;mrow class="MJX-TeXAtom-ORD"&gt;    &lt;mi class="MJX-tex-caligraphic" mathvariant="script"&gt;V&lt;/mi&gt;  &lt;/mrow&gt;&lt;/math&gt;, and apply an equivalence between the finite &lt;math xmlns="http://www.w3.org/1998/Math/MathML"&gt;  &lt;mrow class="MJX-TeXAtom-ORD"&gt;    &lt;mi class="MJX-tex-caligraphic" mathvariant="script"&gt;V&lt;/mi&gt;  &lt;/mrow&gt;&lt;/math&gt;-algebras and a category of finite structured sets and relations. By instantiating this to different varieties we recover three well-studied canonical nfas (the átomaton, the jiromaton and the minimal xor automaton) and obtain a new canonical nfa called the distromaton. We prove that each of these nfas is minimal relative to a suitable measure, and give conditions for state-minimality. Our approach is coalgebraic, exhibiting additional structure and universal properties.</p>
            </abstract>
            <particDesc>
              <org type="consortium">TC 1</org>
              <org type="consortium">WG 1.3</org>
            </particDesc>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="institution" xml:id="struct-71839" status="VALID">
          <orgName>Technische Universität Braunschweig = Technical University of Braunschweig [Braunschweig]</orgName>
          <desc>
            <address>
              <addrLine>38092 Braunschweig</addrLine>
              <country key="DE"/>
            </address>
            <ref type="url">http://www.tu-braunschweig.de/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-311714" status="VALID">
          <idno type="ROR">https://ror.org/00f7hpc57</idno>
          <orgName>Friedrich-Alexander Universität Erlangen-Nürnberg = University of Erlangen-Nuremberg</orgName>
          <orgName type="acronym">FAU</orgName>
          <desc>
            <address>
              <addrLine>Schlossplatz 4, 91054 Erlangen, Germany</addrLine>
              <country key="DE"/>
            </address>
            <ref type="url">http://www.fau.eu/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>