Monday, July 7

18:00-20:00 Welcome Party

Tuesday, July 8

8:45 Opening of DLT 2003

Session 1: Tree Automata
Chair: Z. Ésik

9:00 Invited Lecture: F. Gécseg (Szeged, Hungary):  Comments on Complete Sets of Tree Automata

10:00 Break

Session  2: Automata with Multiplicities
Chair: W. Kuich

10:30 B. Borchardt (Dresden, Germany):  The Myhill-Nerode Theorem for Recognizable Tree Series

11:00 P. Caron (Rouen, France) and M. Flouret (Le Havre, France):  From Glushkov WFAs to Rational Expressions

11:30 I. Klimann, S. Lombardy, J. Mairesse and C. Prieur (Paris, France):  Deciding the Sequentiality of a Finitely Ambiguous Max-Plus Automaton

12:00 Lunch

Session 3: Algebraic Language Theory
Chair: A. Bertoni

14:00 Invited Lecture: A. C. Gomez (Valencia, Spain) and J.-E. Pin (Paris, France):  On a Conjecture of Schnoebelen

15:00 L. Polák (Brno, Czech Republic):  Syntactic Semiring and Universal Automaton

15:30 Break

Session 4: Trees
Chair: F. Gécseg

16:00 J. Carme, R. Gilleron, A. Lemay, A. Terlutte and M. Tommasi (Lille, France):  Residual Finite Tree Automata

16:30 F. Drewes and J. Högberg (Umeå, Sweden):  Learning a Regular Tree Language from a Teacher

17:00 G. Rahonis (Thessaloniki, Greece):  Alphabetic Pushdown Tree Transducers

17:30 F. Drewes (Umeå, Sweden) and J. Engelfriet (Leiden, The Netherlands):  Branching Grammars: A Generalization of ET0L Systems

19:00 Reception at the Town Hall

Wednesday, July 9

Session 5: Quantum Computing
Chair: F. Otto

9:00 Invited Lecture: A. Bertoni (Milan, Italy), C. Mereghetti  and B. Palano:  Quantum Computing: 1-way Quantum Automata

10:00  Break

Session 6: Combinatorics
Chair: Ch. Choffrut

10:30 M. Anselmo (Salerno, Italy) and M. Madonia (Catania, Italy):  Covering Problems from a Formal Language Point of View

11:00 A. Bouillard and J. Mairesse (Paris, France):  Generating Series of the Trace Group

11:30 D. de Falco, M. Goldwurm and V. Lonati (Milan, Italy):  Frequency of Symbol Occurrences in Simple Non-Primitive Stochastic Models

12:00 Lunch

15:00-17:30 Sightseeing in Szeged

20:00 Conference Dinner

Thursday, July 10

Session 7: Automata and Model Checking
Chair: H. Vollmer

9:00 Invited Lecture: J. Esparza (Stuttgart, Germany):  An Automata-Theoretic Approach to Software Verification

10:00 Break

Session 8: Finite Automata
Chair: J.-É. Pin

10:30 J.-M. Champarnaud and F. Coulon (Rouen, France):  NFA Reduction Algorithms by Means of Regular Inequalities

11:00 M. Domaratzki (Kingston, Canada):   On Enumeration of Müller Automata, talk presented by A. Okhotin

11:30 A. Malcher (Frankfurt am Main, Germany):  Minimizing Finite Automata Is Computationally Hard

12:00 Lunch

Session 9: Language Theory I
Chair: H.J. Hoogeboom

14:00 Invited Lecture: F. Otto (Kassel, Germany):  Restarting Automata and Their Relations to the Chomsky Hierarchy

15:00 D. Giammarresi (Rome, Italy):  Computing Languages by (Bounded) Local Sets

15:30 Break

Session 10: Language Theory II
Chair: J. Esparza

16:00 F. D'Alessandro and S. Varricchio (Rome, Italy):  On Well Quasi-Orders On Languages

16:30 M. Holzer (München, Germany) and M. Kutrib (Giessen, Germany):  Flip-Pushdown Automata: Nondeterminism is Better Than Determinism

17:00 A. Okhotin (Kingston, Canada):  Boolean Grammars

17:30 D. Hofbauer (Kassel, Germany) and J. Waldmann (Leipzig, Germany):  Deleting String Rewriting Systems Preserve Regularity

Friday, July 11

Session 11: Language Theory and Complexity
Chair: M. Ito

9:00 Invited Lecture: H. Vollmer (Hannover, Germany):  Complexity Theory Made Easy: The Formal Language Approach to the Definition of Complexity Classes

10:00 Break

Session 12: Automata
Chair: W. Plandowski

10:30 D. S. Ananichev and M. V. Volkov (Ekaterinbug, Russia):  Synchronizing Monotonic Automata

11:00 L. A. Hemaspaandra (Rochester, USA), P. Mukherji (Rochester, USA), and T. Tantau (Berlin, Germany):  Computation with Absolutely No Space Overhead

11:30 M. Holzer and B. König (München, Germany):  On Deterministic Finite Automata and Syntactic Monoid Size, Continued

12:00 Lunch

Session 13: Combinatorics on Words
Chair: M. Holzer

14:00 Invited Lecture: W. Plandowski (Warsaw, Poland):  Test Sets for Large Families of Languages

15:00 T. Harju and D. Nowotka (Turku, Finland):  About Duval's Conjecture

15:30 Break

Session 14: Computational Mechanisms
Chair: Z. Fülöp

16:00 E. Csuhaj-Varjú (Budapest, Hungary), V. Mitrana (Bucharest, Romania) and Gy. Vaszil (Budapest, Hungary):  Distributed Pushdown Automata Systems: Computational Power

16:30 R. Freund (Vienna, Austria), C. Martín-Vide (Tarragona, Spain), A. Obtulowicz (Warsaw, Poland) and G. Paun (Bucharest, Romania):  On Three Classes of Automata-Like P Systems

17:00 P. Bonizzoni (Milan, Italy), C. De Felice (Salerno, Italy), G. Mauri (Milan, Italy) and R. Zizza (Salerno, Italy):  Regular Languages Generated by Reflexive Finite Splicing Systems

17:30 S. Crespi Reghizzi and M. Pradella (Milan, Italy):  Tile Rewriting Grammars

18:00 Closing of DLT 2003

Registration at Hotel Novotel, Szeged, Maros u. 1.

Monday	18:00 - 20:00
Tuesday	8:30 - 12:00
Wednesday	8:30 - 12:00

Sponsors of DLT 2003

Department of Informatics, University of Szeged

Fund for Szeged

The Ministry of Education of Hungary

Hewlett Packard Hungary

Publisher: Springer-Verlag