<?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-01905625</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:32+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Cover Complexity of Finite Languages</title>
            <author role="aut">
              <persName>
                <forename type="first">Stefan</forename>
                <surname>Hetzl</surname>
              </persName>
              <email type="md5">a518f7be04659206b9c1c950f084533a</email>
              <email type="domain">tuwien.ac.at</email>
              <idno type="idhal" notation="numeric">1038028</idno>
              <idno type="halauthorid" notation="string">474905-1038028</idno>
              <affiliation ref="#struct-19098"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Simon</forename>
                <surname>Wolfsteiner</surname>
              </persName>
              <email type="md5">9d5bc0cb2fc6feaad042491a18fbb60b</email>
              <email type="domain">tuwien.ac.at</email>
              <idno type="idhal" notation="numeric">1038029</idno>
              <idno type="halauthorid" notation="string">1444122-1038029</idno>
              <affiliation ref="#struct-19098"/>
            </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">2018-10-26 08:01:05</date>
              <date type="whenModified">2026-01-09 13:32:03</date>
              <date type="whenReleased">2018-10-26 08:05:10</date>
              <date type="whenProduced">2018-07-25</date>
              <date type="whenEndEmbargoed">2021-01-01</date>
              <ref type="file" target="https://inria.hal.science/hal-01905625v1/document">
                <date notBefore="2021-01-01"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-01905625v1/file/470153_1_En_12_Chapter.pdf" id="file-1905625-1936122">
                <date notBefore="2021-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-01905625</idno>
            <idno type="halUri">https://inria.hal.science/hal-01905625</idno>
            <idno type="halBibtex">hetzl:hal-01905625</idno>
            <idno type="halRefHtml">&lt;i&gt;20th International Conference on Descriptional Complexity of Formal Systems (DCFS)&lt;/i&gt;, Jul 2018, Halifax, NS, Canada. pp.139-150, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-319-94631-3_12"&gt;&amp;#x27E8;10.1007/978-3-319-94631-3_12&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">20th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2018, Halifax, NS, Canada. pp.139-150, &amp;#x27E8;10.1007/978-3-319-94631-3_12&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://creativecommons.org/licenses/by/4.0/">CC BY 4.0 - Attribution<ref corresp="#file-1905625-1936122"/></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-10952" 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">Cover Complexity of Finite Languages</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Stefan</forename>
                    <surname>Hetzl</surname>
                  </persName>
                  <email type="md5">a518f7be04659206b9c1c950f084533a</email>
                  <email type="domain">tuwien.ac.at</email>
                  <idno type="idhal" notation="numeric">1038028</idno>
                  <idno type="halauthorid" notation="string">474905-1038028</idno>
                  <affiliation ref="#struct-19098"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Simon</forename>
                    <surname>Wolfsteiner</surname>
                  </persName>
                  <email type="md5">9d5bc0cb2fc6feaad042491a18fbb60b</email>
                  <email type="domain">tuwien.ac.at</email>
                  <idno type="idhal" notation="numeric">1038029</idno>
                  <idno type="halauthorid" notation="string">1444122-1038029</idno>
                  <affiliation ref="#struct-19098"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">Lecture Notes in Computer Science</title>
                <meeting>
                  <title>20th International Conference on Descriptional Complexity of Formal Systems (DCFS)</title>
                  <date type="start">2018-07-25</date>
                  <date type="end">2018-07-27</date>
                  <settlement>Halifax, NS</settlement>
                  <country key="CA">Canada</country>
                </meeting>
                <editor>Stavros Konstantinidis</editor>
                <editor>Giovanni Pighizzini</editor>
                <imprint>
                  <publisher>Springer International Publishing</publisher>
                  <biblScope unit="serie">Descriptional Complexity of Formal Systems</biblScope>
                  <biblScope unit="volume">LNCS-10952</biblScope>
                  <biblScope unit="pp">139-150</biblScope>
                  <date type="datePub">2018</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/978-3-319-94631-3_12</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>We consider the notion of cover complexity of finite languages on three different levels of abstraction. For arbitrary cover complexity measures, we give a characterisation of the situations in which they collapse to a bounded complexity measure. Moreover, we show for a restricted class of context-free grammars that its grammatical cover complexity measure w.r.t. a finite language L is unbounded and that the cover complexity of L can be computed from the exact complexities of a finite number of covers $$L' \supseteq L$$. We also investigate upper and lower bounds on the grammatical cover complexity of the language operations intersection, union, and concatenation on finite languages for several different types of context-free grammars.</p>
            </abstract>
            <particDesc>
              <org type="consortium">TC 1</org>
              <org type="consortium">WG 1.2</org>
            </particDesc>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="institution" xml:id="struct-19098" status="VALID">
          <idno type="IdRef">030036496</idno>
          <idno type="ROR">https://ror.org/04d836q62</idno>
          <orgName>Vienna University of Technology = Technischen Universität Wien</orgName>
          <orgName type="acronym">TU Wien</orgName>
          <desc>
            <address>
              <addrLine>Karlsplatz 13, 1040 Vienna</addrLine>
              <country key="AT"/>
            </address>
            <ref type="url">https://www.tuwien.at/en/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>