Abstract is missing.
- Rewriting, Möbius Functions and Semi-CommutationsVolker Diekert. 1-15
- Simulations Between Different Models of Parallel ComputersMartin Dietzfelbinger. 16-30
- Dense and Disjunctive Properties of LanguagesMasami Ito. 31-49
- The Hierarchy of CodesHelmut Jürgensen, Stavros Konstantinidis. 50-68
- Five Facets of Hyperedge Replacement Beyond Context-FreenessHans-Jörg Kreowski. 69-86
- An Action Structure for Synchronous pi-CalculusRobin Milner. 87-105
- AC:::0::: Circuit ComplexityPavel Pudlák. 106-120
- Pattern Languages: Problems of Decidability and GenerationArto Salomaa. 121-132
- General Solution of Mirror EquationHabib Abdulrab, Marianne Maksimenko. 133-141
- Decidability of Equivalence for Linear Letter to Letter To-down Tree TransducersYves Andre, Francis Bossut. 142-151
- Translations Between Flowchart Schemes and Process GraphsJan A. Bergstra, Gheorghe Stefanescu. 152-161
- Local Equational LogicVirgil Emil Cazanescu. 162-170
- Liveness of Weighted Circuits and the Diophantine Problem of FrobeniusPiotr Chrzastowski-Wachtel, Marek Raczunas. 171-180
- Context-Free Graph Grammars: Separating Vertex Replacement from Hyperedge ReplacementBruno Courcelle. 181-193
- Formal Languages Consisting of Primitive WordsPál Dömösi, Sándor Horváth, Masami Ito, László Kászonyi, Masashi Katsura. 194-203
- Undecidability of the Surjectivity Problem for 2D Cellular Automata: A Simplified ProofBruno Durand. 204-211
- Efficient Interpretation of State ChartsJürgen Ebert. 212-221
- Implementation of a Universal Unification Algorithm for Macro Tree TransducersHeinz Faßbender. 222-233
- Finding Maximum Convex PolygonsPaul Fischer. 234-243
- Approximations with Axis-Aligned Rectangles (Extended Abstract)Paul Fischer, Klaus-Uwe Höffgen, Hanno Lefmann, Tomasz Luczak. 244-255
- Vector Sequence Analysis and Full Weak Safety for Concurrent SystemsMahesh Girkar, Robert Moll. 256-265
- Does Transitivity Help? On the Complexity of Poset PropertiesHans Dietmar Gröger. 266-278
- Generalized Topological Sorting in Linear TimeTorben Hagerup, Martin Maas. 279-288
- Easity Checked Self-Reducibility (Extended Abstract)Lane A. Hemachandra, Riccardo Silvestri. 289-298
- On the Complexities of Linear LL(1) and LR(1) GrammarsMarkus Holzer, Klaus-Jörn Lange. 299-308
- On the Relation Between Firing Sequences and Processes of Petri NetsDang Van Hung, Tran Van Dung. 309-318
- Maximum Covering with D CliquesKlaus Jansen, Petra Scheffler, Gerhard J. Woeginger. 319-328
- Monotonically Labelled Ordered Trees and Multidimensional Binary TreesRainer Kemp. 329-341
- A Maximum Path Length Pumping Lemma for Edge-Replacement LanguagesSabine Kuske. 342-351
- Regular Approximations to Shuffle Products of Context-free Languages, and Convergence of their Generating FunctionsRobert S. Maier, René Schott. 352-362
- The Equational Theory of a Boolean MonadErnest G. Manes. 363-374
- Non Erasing Turing Machines: A Frontier Between a Decidable Halting Problem and UniversalityMaurice Margenstern. 375-385
- On Scattered Syntactic MonoidsAlexandru Mateescu. 386-395
- Regular Tree Languages Without Unary Symbols are Star-FreeAndreas Potthoff, Wolfgang Thomas. 396-405
- One-way Cellular Automata on Cayley GraphsZsuzsanna Róka. 406-417
- On Tree Pattern Unification ProblemsPeter Ruzicka, Igor Prívara. 418-429
- Structural Equivalences and ET0L Grammars (Extended Abstract)Kai Salomaa, Derick Wood, Sheng Yu. 430-439
- A Hierarchy of Deterministic Top-down Tree TransformationsGiora Slutzki, Sándor Vágvölgyi. 440-451
- Synthesis of O(lg n) Testable TreesHongzhong Wu. 452-461
- On the Learnability of a Restricted Predicate FormulaeJilei Yin, Zhu Hong. 462-471