<?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-23T21:55:23Z</responseDate>
  <request identifier="1317" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:1317</identifier>
        <datestamp>2024-03-06T10:33:02Z</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>Analytic aspects of the shuffle product</dc:title>
          <dc:creator>Mishna, Marni</dc:creator>
          <dc:creator>Zabrocki, Mike</dc:creator>
          <dc:subject>Generating functions</dc:subject>
          <dc:subject>formal languages</dc:subject>
          <dc:subject>shuffle product</dc:subject>
          <dc:description>There exist very lucid explanations of the combinatorial origins of&#13;
   rational and algebraic functions, in particular with respect to&#13;
   regular and context free languages.  In the search to understand&#13;
   how to extend these natural correspondences, we find that the&#13;
   shuffle product models many key aspects of D-finite generating&#13;
   functions, a class which contains algebraic.  We consider several&#13;
   different takes on the shuffle product, shuffle closure, and&#13;
   shuffle grammars, and give explicit generating function&#13;
   consequences.  In the process, we define a grammar class that&#13;
   models D-finite generating functions.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Marni Mishna and Mike Zabrocki</dc:contributor>
          <dc:date>2008</dc:date>
          <dc:relation>Is Part Of LIPIcs, Volume 1, 25th International Symposium on Theoretical Aspects of Computer Science (2008)</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/LIPIcs.STACS.2008.1317</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-13178</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1317</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by-nd/3.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
