Abstract is missing.
- On Generalizations of Weighted Finite Automata and Graphics ApplicationsJürgen Albert, German Tischler. 1-22 [doi]
- Sturmian and Episturmian WordsJean Berstel. 23-47 [doi]
- From Tree-Based Generators to Delegation NetworksFrank Drewes. 48-72 [doi]
- Bifinite Chu SpacesManfred Droste, Guo-Qiang Zhang. 73-74 [doi]
- Tiling Recognizable Two-Dimensional LanguagesDora Giammarresi. 75-86 [doi]
- Algebraic Methods in Quantum InformaticsJozef Gruska. 87-111 [doi]
- Recognizable vs. Regular Picture LanguagesOliver Matz. 112-121 [doi]
- From Algebraic Graph Transformation to Adhesive HLR Categories and SystemsUlrike Prange, Hartmut Ehrig. 122-146 [doi]
- Deterministic Two-Dimensional Languages over One-Letter AlphabetMarcella Anselmo, Maria Madonia. 147-159 [doi]
- Recognizable Picture Languages and PolyominoesGiusi Castiglione, Roberto Vaglica. 160-171 [doi]
- An Algebra for Tree-Based Music GenerationFrank Drewes, Johanna Högberg. 172-188 [doi]
- Aperiodicity in Tree AutomataZoltán Ésik, Szabolcs Iván. 189-207 [doi]
- The Syntactic Complexity of Eulerian GraphsAntonios Kalampakas. 208-217 [doi]
- Learning Deterministically Recognizable Tree Series - RevisitedAndreas Maletti. 218-235 [doi]
- The Second Eigenvalue of Random Walks On Symmetric Random Intersection GraphsSotiris E. Nikoletseas, Christoforos Raptopoulos, Paul G. Spirakis. 236-246 [doi]
- Verifying Security Protocols for Sensor Networks Using Algebraic Specification TechniquesIakovos Ouranos, Petros S. Stefaneas. 247-259 [doi]
- Nonassociativity à la KleeneJean Marcel Pallo. 260-274 [doi]
- Restarting Tree Automata and Linear Context-Free Tree LanguagesHeiko Stamer, Friedrich Otto. 275-289 [doi]