Theorietag 2012 Gesellschaft fr Informatik Charles University in Prague

  • Increase font size
  • Default font size
  • Decrease font size

Program

E-mail Print PDF

Tuesday, October 2, 2012

17:00 – 20:00 Registration and dinner

Workshop "Application of Formal Languages"

Wednesday, October 3, 2012

09:40 – 09:45 Opening
09:45 – 10:45 Jan Holub:
The Finite Automata Approaches for Bioinformatics
10:45 – 11:15 Coffee break
11:15 – 12:15 Petr Jančar:
Language Equivalence of Deterministic Pushdown Automata via First-Order Grammars
12:30 – 14:00 Lunch
14:00 – 15:00 Karel Oliva:
Grammars of Ungrammatical Strings
15:00 – 15:15 Pause
15:15 – 16:15 Heiko Vogler:
Weighted Tree Automata and Tree Transducers can help in Statistical Machine Translation of Natural Languages
16:15 – 16:45 Coffee break
16:45 – 17:45 Zdenek Žabokrtský:
Machine Translation using Dependency Trees
18:00 – 19:00 Dinner

Theorietag

Thursday, October 4, 2012

08:45 – 08:50 Opening
08:50 – 10:30 Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
States and Heads Do Count For Unary Multi-Head Finite Automata
Markus Holzer, Sebastian Jakobi:
State Complexity of Chop Operations on Unary and Finite Languages
Markus Holzer, Sebastian Jakobi:
From Equivalence to Almost-Equivalence, and   Beyond—Minimizing Automata With Errors
Martin Kutrib, Katja Meckel, Matthias Wendlandt:
Manipulation of Finite Automata – A Small Leak Will Sink a Great Ship
10:30 – 11:00 Coffee Break
11:00 – 12:15 Vladislav Kuboň, Markéta Lopatková, Martin Plátek:
How to Measure Word Order Freedom for Natural Languages?
Matthias Büchse:
As Easy As Vanda, Two, Three: Components for Machine Translation  Based on Formal Grammars
Fabienne Braune, Nina Seemann, Daniel Quernheim, Andreas Maletti:
Machine Translation with Multi Bottom-up Tree Transducers
12:30 – 14:00 Lunch
14:00 – 15:40 Artiom  Alhazov, Rudolf Freund, Hilbert Heikenwälder, Marion Oswald, Yurii Rogozhin, Sergey Verlan:
Time-Varying Sequential P Systems

Marcel Vollweiler:
Closure Properties of Parallel Communicating Restarting Automata Systems
Martin Procházka, Martin Plátek:
On Localization of (Post)Prefix (In)Consistencies
Friedrich Otto, Peter Černo, František Mráz:
Limited Context Restarting Automata and McNaughton Families of Languages
15:40 – 16:10 Coffee Break
16:10 – 17:25 Florin Manea, Bianca Truthe:
On Internal Contextual Grammars with  Subregular Selection Languages
Daniel Průša, František Mráz:
New Model for Picture Languages Recognition: Two-dimensional Sgraffito Automaton
Dietrich Kuske:
Isomorphisms of Linear Orders Given by Automata
17:25 – 17:40 Pause
17:40 – 18:10 Meeting of SIG “Automata and Formal Languages”
19:30 – 21:30 Conference dinner, Profesní dum, Malostranské námestí

Friday October 5, 2012

08:50 – 10:30 Gerhard Lischke:
Lohmann Words and More Clusters of Words
Florin Manea, Mike Müller, Dirk Nowotka:
Avoidability of Cubes under Morphic Permutations
Stephan Barth:
Representation of ω-regular Languages by Finite Automata
Pawel Gawrychowski, Florin Manea, Robert Mercas, Dirk Nowotka, Catalin Tiseanu:
Finding Pseudo-Repetitions
10:30 – 11:00 Coffee Break
11:00 – 12:40 Jürgen Dassow, Florin Manea, Robert Mercas:
Connecting Partial Words and Regular Languages
Franz Jahn, Manfred Kufleitner, Alexander Lauser:
Regular Ideal Languages and Their Boolean Combinations
Markus L. Schmid:
Inside the Class of REGEX Languages
Dominik D. Freydenberger, Timo Kötzing:
Fast Descriptive Generalization  of Restricted Regular Expressions and DTDs
12:40 – 12:50 Closing
13:00 – 14:00 Lunch