<h2>Dagstuhl Seminar Proceedings, Volume 10501, </h2> <ul> <li> <span class="authors">Christian Glasser, Jean-Eric Pin, Nicole Schweikardt, Victor Selivanov, and Wolfgang Thomas</span> <span class="title">10501 Abstracts Collection – Advances and Applications of Automata on Words and Trees</span> <a class="doi" href="https://doi.org/10.4230/DagSemProc.10501.1">10.4230/DagSemProc.10501.1</a> </li> <li> <span class="authors">Christian Glasser, Jean-Eric Pin, Nicole Schweikardt, Victor Selivanov, and Wolfgang Thomas</span> <span class="title">10501 Executive Summary – Advances and Applications of Automata on Words and Trees</span> <a class="doi" href="https://doi.org/10.4230/DagSemProc.10501.2">10.4230/DagSemProc.10501.2</a> </li> <li> <span class="authors">Alexander Okhotin and Christian Reitwießner</span> <span class="title">Parsing Unary Boolean Grammars Using Online Convolution</span> <a class="doi" href="https://doi.org/10.4230/DagSemProc.10501.3">10.4230/DagSemProc.10501.3</a> </li> </ul>
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing