<?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-02387288</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-20T23:06:37+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Limited Automata: Properties, Complexity and Variants</title>
            <author role="aut">
              <persName>
                <forename type="first">Giovanni</forename>
                <surname>Pighizzini</surname>
              </persName>
              <email type="md5">45ce188bd9f9fe56a71426cb25cd56ff</email>
              <email type="domain">di.unimi.it</email>
              <idno type="idhal" notation="numeric">1022718</idno>
              <idno type="halauthorid" notation="string">1261106-1022718</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-7509-7842</idno>
              <affiliation ref="#struct-225460"/>
            </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:37</date>
              <date type="whenModified">2023-11-23 14:44:05</date>
              <date type="whenReleased">2019-11-29 17:01:53</date>
              <date type="whenProduced">2019-07-17</date>
              <date type="whenEndEmbargoed">2022-01-01</date>
              <ref type="file" target="https://inria.hal.science/hal-02387288v1/document">
                <date notBefore="2022-01-01"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-02387288v1/file/480958_1_En_4_Chapter.pdf" id="file-2387288-2283160">
                <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-02387288</idno>
            <idno type="halUri">https://inria.hal.science/hal-02387288</idno>
            <idno type="halBibtex">pighizzini:hal-02387288</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.57-73, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-030-23247-4_4"&gt;&amp;#x27E8;10.1007/978-3-030-23247-4_4&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.57-73, &amp;#x27E8;10.1007/978-3-030-23247-4_4&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://creativecommons.org/licenses/by/4.0/">CC BY 4.0 - Attribution<ref corresp="#file-2387288-2283160"/></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">Limited Automata: Properties, Complexity and Variants</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Giovanni</forename>
                    <surname>Pighizzini</surname>
                  </persName>
                  <email type="md5">45ce188bd9f9fe56a71426cb25cd56ff</email>
                  <email type="domain">di.unimi.it</email>
                  <idno type="idhal" notation="numeric">1022718</idno>
                  <idno type="halauthorid" notation="string">1261106-1022718</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-7509-7842</idno>
                  <affiliation ref="#struct-225460"/>
                </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">57-73</biblScope>
                  <date type="datePub">2019</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/978-3-030-23247-4_4</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>Limited automata are single-tape Turing machines with severe rewriting restrictions. They have been introduced in 1967 by Thomas Hibbard, who proved that they have the same computational power as pushdown automata. Hence, they provide an alternative characterization of the class of context-free languages in terms of recognizing devices. After that paper, these models have been almost forgotten for many years. Only recently limited automata were reconsidered in a series of papers, where several properties of them and of their variants have been investigated. In this work we present an overview of the most important results obtained in these researches. We also discuss some related models and possible lines for future investigations.</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="laboratory" xml:id="struct-225460" status="VALID">
          <orgName>Dipartimento di Informatica</orgName>
          <orgName type="acronym">ISLab</orgName>
          <desc>
            <address>
              <addrLine>Information Systems and knowledge management - Via Festa del Perdono 7 - 20122 Milano</addrLine>
              <country key="IT"/>
            </address>
            <ref type="url">http://www.di.unimi.it/ecm/home</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300694" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300694" status="VALID">
          <idno type="ROR">https://ror.org/00wjc7c48</idno>
          <orgName>Università degli Studi di Milano = University of Milan</orgName>
          <orgName type="acronym">UNIMI</orgName>
          <desc>
            <address>
              <addrLine>Via Festa del Perdono 7 - 20122 Milano</addrLine>
              <country key="IT"/>
            </address>
            <ref type="url">http://www.unimi.it</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>