<?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-02387287</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-21T00:20:37+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">State Complexity of GF(2)-Concatenation and GF(2)-Inverse on Unary Languages</title>
            <author role="aut">
              <persName>
                <forename type="first">Alexander</forename>
                <surname>Okhotin</surname>
              </persName>
              <email type="md5">8485ad60a2578871714eb73246a282d3</email>
              <email type="domain">spbu.ru</email>
              <idno type="idhal" notation="numeric">1024589</idno>
              <idno type="halauthorid" notation="string">262981-1024589</idno>
              <affiliation ref="#struct-119036"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Elizaveta</forename>
                <surname>Sazhneva</surname>
              </persName>
              <email type="md5">92029801a5760a05de378bf8fd71dfdf</email>
              <email type="domain">yandex.ru</email>
              <idno type="idhal" notation="numeric">1059498</idno>
              <idno type="halauthorid" notation="string">1730363-1059498</idno>
              <affiliation ref="#struct-119036"/>
            </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">2019-11-29 16:35:34</date>
              <date type="whenModified">2019-11-29 17:01:54</date>
              <date type="whenReleased">2019-11-29 17:01:54</date>
              <date type="whenProduced">2019-07-17</date>
              <date type="whenEndEmbargoed">2022-01-01</date>
              <ref type="file" target="https://inria.hal.science/hal-02387287v1/document">
                <date notBefore="2022-01-01"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-02387287v1/file/480958_1_En_19_Chapter.pdf" id="file-2387287-2283159">
                <date notBefore="2022-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-02387287</idno>
            <idno type="halUri">https://inria.hal.science/hal-02387287</idno>
            <idno type="halBibtex">okhotin:hal-02387287</idno>
            <idno type="halRefHtml">&lt;i&gt;21th International Conference on Descriptional Complexity of Formal Systems (DCFS)&lt;/i&gt;, Jul 2019, Košice, Slovakia. pp.248-259, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-030-23247-4_19"&gt;&amp;#x27E8;10.1007/978-3-030-23247-4_19&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">21th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2019, Košice, Slovakia. pp.248-259, &amp;#x27E8;10.1007/978-3-030-23247-4_19&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://creativecommons.org/licenses/by/4.0/">CC BY 4.0 - Attribution<ref corresp="#file-2387287-2283159"/></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-WG" corresp="IFIP">Working Groups</idno>
            <idno type="stamp" n="IFIP-DCFS" corresp="IFIP">Descriptional Complexity of Formal Systems</idno>
            <idno type="stamp" n="IFIP-WG1-2" corresp="IFIP-WG">WG 1.2: Descriptional Complexity</idno>
            <idno type="stamp" n="IFIP-LNCS-11612" corresp="IFIP-LNCS">Descriptional Complexity of Formal Systems</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">State Complexity of GF(2)-Concatenation and GF(2)-Inverse on Unary Languages</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Alexander</forename>
                    <surname>Okhotin</surname>
                  </persName>
                  <email type="md5">8485ad60a2578871714eb73246a282d3</email>
                  <email type="domain">spbu.ru</email>
                  <idno type="idhal" notation="numeric">1024589</idno>
                  <idno type="halauthorid" notation="string">262981-1024589</idno>
                  <affiliation ref="#struct-119036"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Elizaveta</forename>
                    <surname>Sazhneva</surname>
                  </persName>
                  <email type="md5">92029801a5760a05de378bf8fd71dfdf</email>
                  <email type="domain">yandex.ru</email>
                  <idno type="idhal" notation="numeric">1059498</idno>
                  <idno type="halauthorid" notation="string">1730363-1059498</idno>
                  <affiliation ref="#struct-119036"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">Lecture Notes in Computer Science</title>
                <meeting>
                  <title>21th International Conference on Descriptional Complexity of Formal Systems (DCFS)</title>
                  <date type="start">2019-07-17</date>
                  <date type="end">2019-07-19</date>
                  <settlement>Košice</settlement>
                  <country key="SK">Slovakia</country>
                </meeting>
                <editor>Michal Hospodár</editor>
                <editor>Galina Jirásková</editor>
                <editor>Stavros Konstantinidis</editor>
                <imprint>
                  <publisher>Springer International Publishing</publisher>
                  <biblScope unit="serie">Descriptional Complexity of Formal Systems</biblScope>
                  <biblScope unit="volume">LNCS-11612</biblScope>
                  <biblScope unit="pp">248-259</biblScope>
                  <date type="datePub">2019</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/978-3-030-23247-4_19</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>The paper investigates the state complexity of two operations on regular languages, known as GF(2)-concatenation and GF(2)-inverse (Bakinova et al., “Formal languages over GF(2)”, LATA 2018), in the case of a one-symbol alphabet. The GF(2)-concatenation is a variant of the classical concatenation obtained by replacing Boolean logic in its definition with the GF(2) field; it is proved that GF(2)-concatenation of two unary languages recognized by an m-state and an n-state DFA is recognized by a DFA with 2mn states, and this number of states is necessary in the worst case, as long as m and n are relatively prime. This operation is known to have an inverse, and the state complexity of the GF(2)-inverse operation over a unary alphabet is proved to be exactly $$2^{n-1}+1$$.</p>
            </abstract>
            <particDesc>
              <org type="consortium">TC 1</org>
              <org type="consortium">WG 1.02</org>
            </particDesc>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="institution" xml:id="struct-119036" status="VALID">
          <idno type="IdRef">033629676</idno>
          <idno type="ROR">https://ror.org/023znxa73</idno>
          <orgName>St Petersburg State University</orgName>
          <orgName type="acronym">SPbU</orgName>
          <desc>
            <address>
              <addrLine>7/9 Universitetskaya emb., St. Petersburg, 199034</addrLine>
              <country key="RU"/>
            </address>
            <ref type="url">http://english.spbu.ru</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>