eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dagstuhl Seminar Proceedings
1862-4405
2011-05-26
10501
1
12
10.4230/DagSemProc.10501.1
article
10501 Abstracts Collection – Advances and Applications of Automata on Words and Trees
Glasser, Christian
Pin, Jean-Eric
Schweikardt, Nicole
Selivanov, Victor
Thomas, Wolfgang
From 12.12.2010 to 17.12.2010, the Dagstuhl Seminar 10501
``Advances and Applications of Automata on Words and Trees'' was held
in Schloss Dagstuhl~--~Leibniz Center for Informatics.
During the seminar, several participants presented their current
research, and ongoing work and open problems were discussed. Abstracts of
the presentations given during the seminar as well as abstracts of
seminar results and ideas are put together in this paper. The first section
describes the seminar topics and goals in general.
Links to extended abstracts or full papers are provided, if available.
https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol10501/DagSemProc.10501.1/DagSemProc.10501.1.pdf
Automata theory
logic
verification
data structures
algorithms
complexity
games
infinite games with perfect information
reactive systems
specification and verification
combinatorics
hierarchies and reducibilities
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dagstuhl Seminar Proceedings
1862-4405
2011-05-26
10501
1
4
10.4230/DagSemProc.10501.2
article
10501 Executive Summary – Advances and Applications of Automata on Words and Trees
Glasser, Christian
Pin, Jean-Eric
Schweikardt, Nicole
Selivanov, Victor
Thomas, Wolfgang
The aim of the seminar was to discuss and systematize
the recent fast progress in automata theory and to identify
important directions for future research.
For this, the seminar brought together more than 40 researchers
from automata theory and related fields of applications.
We had 19 talks of 30 minutes and 5 one-hour lectures
leaving ample room for discussions.
In the following we describe the topics in more detail.
https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol10501/DagSemProc.10501.2/DagSemProc.10501.2.pdf
Infinite games with perfect information
reactive systems
specification and verification
combinatorics
hierarchies and reducibilities
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dagstuhl Seminar Proceedings
1862-4405
2011-05-26
10501
1
11
10.4230/DagSemProc.10501.3
article
Parsing Unary Boolean Grammars Using Online Convolution
Okhotin, Alexander
Reitwießner, Christian
In contrast to context-free grammars, the extension of these
grammars by explicit conjunction, the so-called conjunctive
grammars can generate (quite complicated) non-regular languages
over a single-letter alphabet (DLT 2007). Given these
expressibility results, we study the parsability of Boolean grammars,
an extension of context-free grammars by conjunction and negation,
over a unary alphabet and show that they can be parsed in time O(|G| log^2(n) M(n))
where M(n) is the time to multiply two n-bit integers. This multiplication
algorithm is transformed into a convolution algorithm which in turn is
converted to an online convolution algorithm which is used for the parsing.
https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol10501/DagSemProc.10501.3/DagSemProc.10501.3.pdf