Abstract is missing.
- On the Subword Complexity and Square-Freeness of Formal LanguagesAndrzej Ehrenfeucht, Grzegorz Rozenberg. 1-4
- Cycle-Free N-Algebraic SystemsWerner Kuich. 5-12
- On the Height of Syntactical GraphsFranz-Josef Brandenburg. 13-21
- Boolean Functions Whose Monotone Complexity is of Size n:::2:::/log nIngo Wegener. 22-31
- Netzwerke zur simultanen Berechnung Boolescher FunktionenJürgen Sattler. 32-40
- P-Complete Problems in Free GroupsJürgen Avenhaus, Klaus Madlener. 42-51
- Quelques propriétés des langages à un ComptuerMichel Latteux. 52-63
- Un resultat de discontinuité dans les familles de langagesJean-Michel Autebert. 64-69
- Verallgemeinerte kommutative SprachenIoannis Keklikoglou. 70-75
- Ein rein automatentheoretischer Aufbau der Theorie der kontext-freien SprachenGünter Hotz. 76-77
- Un analogue du théorème des variétés pour les cones et les cylindresJean-Eric Pin. 78-90
- A Family of Graphs with Expensive Depth-ReductionGeorg Schnitger. 91-97
- On alpha-balanced Binary Search TreesHenk J. Olivié. 98-108
- Erzeugung optimalen Codes für Series - Parallel GraphsReiner Güttler. 109-122
- Recent Directions in Algorithmic ResearchJohn E. Hopcroft. 123-134
- Dynamic k-Dimensional Multiway Search under Time-Varying Access FrequenciesRalf Hartmut Güting, Hans-Peter Kriegel. 135-145
- Some Applications of CFL s over Infinte AlphabetsLuc Boasson. 146-151
- A Decidable Property of Iterated MorphismsJean-Jacques Pansiot. 152-158
- Prefix-Preservation fo Rational Partial Functions Is DecidableChristian Choffrut. 159-166
- Concurrency and Automata on Infinite SequencesDavid Michael Ritchie Park. 167-183
- An Effective Retract CalculusBernhard Josko. 184-194
- Recursion and Complexity Theory on CPO-SKlaus Weihrauch. 195-202
- Computable Algebras, Word Problems and Canonical Term AlgebrasHerbert Klaeren, Martin Schulz. 203-213
- Reachability Analysis with Assertion SystemsHorst Müller. 214-223
- Dynamization of Decomposable Searching Problems Yielding Good Worsts-Case BoundsMark H. Overmars, Jan van Leeuwen. 224-233
- Robust Balancing in B-TreesScott Huddleston, Kurt Mehlhorn. 234-244
- Centers of LanguagesLuc Boasson, Maurice Nivat. 245-251
- (Erasing)* StringsRonald V. Book, Matthias Jantzen, Celia Wrathall. 252-259