Automata and Algorithmic Logic
Stuttgart, 28-29 June, 2009 (satellite workshop of
The workshop provides the opportunity to assess recent scientific
advances and exchange ideas regarding the interplay of automata and
logic. More specifically, the meeting will focus on recent
developments in the inter-relation of monadic second order logic and
automata, in automatic structures, and in the application of automata
to semi-structured data.
The programme consists of invited talks by
as well as contributed talks. For that purpose, we invite submissions on the
following topics (as well as related fields):
Submissions in the form of an abstract of at most two pages should be
sent to the organizers.
- effective presentations of infinite structures
(e.g., automatic structures, rewriting graphs, Caucal's hierarchy,
algorithmic techniques for monadic second order logic and its fragments
(e.g., modal logics, temporal logics, mu-calculus)
semi-structured data and automata
automata and logics for verification
relation between games, automata, and logics
The workshop is supported by the ESF-programme
AutoMathA. Therefore, we will provide funding for participants.
There is no registration fee.
submission by 21 April, 2009
notification by 28 April, 2009
registration by 12 May, 2009
workshop 28-29 June, 2009
The workshop will take place at the Institut für
Informatik (Computer Science Department) on the Vaihingen
Campus, room 0.463 (ground floor) see the
on the DLT-webpage.
Send an email to Dietrich Kuske (second name at informatik.uni-leipzig.de) with your arrival and
We have reserved a limited number of rooms at the
Telekom Tagungshotel Stuttgart, which is located only 200 meters from
the workshop venue. A reservation form will be sent to all
registered participants soon.
See the DLT-webpage.
Vereinigung von Förderern und Freunden der Universität Leipzig
PS: We do not plan to publish proceedings, but you might be interested in
submitting to the special issue of the
Central European Journal of Mathematics on
Algorithmic model theory, edited by V. Goranko, D. Kuske, and W. Thomas.