Conference Program Download Program (Venue: Prechtlsaal, Hauptgebäude der Technischen Universität Wien, Karlsplatz 13, 1040 Wien) 18:00                Welcome Reception at Hotel Johann Strauß (Favoritenstraße 12, 1040 Wien).                         and 1st Registration   09:00 - 09:15     Opening by Jean-Eric Pin Session 1: Finite Automata. 09:15 - 10:15     Thomas A. Henzinger, IST Austria, Klosterneuburg 09:15 - 10:15     Weighted Automata over Infinite Words 10:15 - 10:45     Coffee break 10:45 - 11:45     Manfred Droste, Universität Leipzig 10:45 - 11:45     Weighted Automata 11:45 - 12:45     Tero Harju, University of Turku 11:45 - 12:45     Finite Transducers and Rational Transductions   12:45 - 14:00     Lunch Session 2a: Trees 14:00 - 15:00     Wolfgang Thomas, RWTH Aachen 14:00 - 15:00     Automata on Finite Trees 15:00 - 16:00     Christof Löding, RWTH Aachen 15:00 - 16:00     Automata on Infinite Trees 16:00 - 16:30     Coffee break Session 2b: Special Guest. 16:30 - 17:30     Hermann Maurer, Technische Universität Graz 16:30 - 17:30     Long Range Forecasting is Necessary but Impossible Session 3: Equations. 09:00 - 10:00     Zoltán Ésik, University of Szeged 09:00 - 10:00     Equational Theories for Automata 10:00 - 10:30     Coffee break 10:30 - 11:30     Michal Kunc, Masaryk University, Brno 10:30 - 11:30     Language Equations 11:30 - 12:30     Olivier Serre, LIAFA, CNRS, Paris 10:30 - 11:30     Recursions Schemes and their Automata Models   12:30 - 14:00     Lunch Session 4: Automata in Mathematics. 14:00 - 15:00     Jeffrey Shallit, University of Waterloo 10:30 - 11:30     Enumeration of Languages, Automata, and Regular Expressions 15:00 - 15:30     Coffee Break 15:30 - 16:30     Pedro Silva, University Porto 10:30 - 11:30     Automorphism Problems in the Free Group of Rank 2 16:30 - 17:30     Søren Eilers, University of Copenhagen 10:30 - 11:30     Classification of Symbolic Dynamical Systems 18:00                Buses leave to Dinner at Heurigen Session 5: Algorithmic Problems on Automata. 09:00 - 10:00     Olivier Carton, Liafa - Universite Paris Diderot 10:30 - 11:30     Minimal Automata 10:00 - 10:30     Coffee break 10:30 - 11:30     Mikhail Volkov, Ural State University, Ekaterinburg 10:30 - 11:30     Cerny's Conjecture and the Road Coloring Problem 11:30 - 12:30     Thomas Wilke, Christian-Albrechts-Universität zu Kiel 10:30 - 11:30     Functional Programs for Regular Expression Matching 12:30 - 14:00     Lunch Session 6: Applications. 14:00 - 15:00     Igor Walukiewicz, LaBRI, CNRS - Université de Bordeaux 10:30 - 11:30     The Synthesis Problem 15:00 - 15:30     Coffee break 15:30 - 16:30     Nicole Schweikardt, Goethe-Universität Frankfurt am Main 15:30 - 16:30     Automata in Document Processing 16:30 - 17:30     Javier Esparza, Universität Stuttgart 10:30 - 11:30     Software Model Checking with Automata                         Closing of Conference