Invited lectures


Opening lecture
Jean Berstel, Sturmian words, Sturmian trees, Sturmian graphs: a survey of some recent results

Jürgen Albert, On generalizations of weighted finite automata and graphics applications
Frank Drewes,  Delegation Networks
Hartmut Ehrig, Ulrike Prange, From Algebraic Graph Transformation to Adhesive HLR Categories and Systems
Dora Giammarresi, Tiling Recognizable Two-dimensional Languages
Jozef Gruska, Algebraic Methods in Quantum Informatics
Jarkko Kari, The tiling problem revisited
Oliver Matz, Recognizable vs. Regular Picture Languages
Guo-Qiang Zhang, Bifinite Chu Spaces


Contributed lectures


Marcella Anselmo, Maria Madonia, Deterministic Two-dimensional Languages over One-Letter Alphabet

G. Castiglione, R. Vaglica, Recognizable Picture Languages and Polyominoes
Frank Drewes, Johanna Högberg, An Algebra for Tree-Based Music Generation
Zoltan Ésik, Szabolcs Iván, Aperiodicity in Tree Automata
Antonios Kalampakas, The Syntactic Complexity of Eulerian Graphs
Andreas Maletti, Learning Deterministically Recognizable Tree Series - Revisited
S. Nikoletseas, C. Raptopulos, P. Spirakis, The Second Eigenvalue of Random Walks on Symmetric Random Intersection Graphs
Iakovos Ouranos, Petros Stefaneas, Verifying Security Protocols for Sensor Networks Using Algebraic Specification Techniques
Jean-Marcel Pallo, Nonassociativity à la Kleene
Heiko Stamer, Friedrich Otto, Restarting Tree Automata and Linear Context-Free Tree Languages