<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-07-21T19:26:07Z</responseDate>
  <request identifier="3147" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:3147</identifier>
        <datestamp>2024-03-06T11:09:33Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>10501 Executive Summary – Advances and Applications of Automata on Words and Trees</dc:title>
          <dc:creator>Glasser, Christian</dc:creator>
          <dc:creator>Pin, Jean-Eric</dc:creator>
          <dc:creator>Schweikardt, Nicole</dc:creator>
          <dc:creator>Selivanov, Victor</dc:creator>
          <dc:creator>Thomas, Wolfgang</dc:creator>
          <dc:subject>Infinite games with perfect information</dc:subject>
          <dc:subject>reactive systems</dc:subject>
          <dc:subject>specification and verification</dc:subject>
          <dc:subject>combinatorics</dc:subject>
          <dc:subject>hierarchies and reducibilities</dc:subject>
          <dc:description>The aim of the seminar was to discuss and systematize&#13;
the recent fast progress in automata theory and to identify&#13;
important directions for future research.&#13;
For this, the seminar brought together more than 40 researchers&#13;
from automata theory and related fields of applications.&#13;
We had 19 talks of 30 minutes and 5 one-hour lectures&#13;
leaving ample room for discussions.&#13;
In the following we describe the topics in more detail.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Christian Glasser and Jean-Eric Pin and Nicole Schweikardt and Victor Selivanov and Wolfgang Thomas</dc:contributor>
          <dc:date>2011</dc:date>
          <dc:relation>Is Part Of Dagstuhl Seminar Proceedings, Volume 10501, Advances and Applications of Automata on Words and Trees (2011)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/DagSemProc.10501.2</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-31474</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.10501.2</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
