Abstract is missing.
- Context-Free Sets of Infinite WordsLuc Boasson. 1-9
- New Aspects of HomomorphismsHermann A. Maurer. 10-24
- Can Partial Correctness Assertions Specify Programming Language Semantics?Albert R. Meyer, Irene Greif. 25-26
- An Algebraic Theory for SynchronizationRobin Milner. 27-35
- Storage Modification MachinesArnold Schönhage. 36-37
- Negative Results on CountingLeslie G. Valiant. 38-46
- Strong Non-Deterministic Context-Free LanguagesJoffroy Beauquier. 47-57
- Information Content Characterizations of Complexity Theoretic PropertiesVictor L. Bennison. 58-66
- Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten BäumenNorbert Blum, Kurt Mehlhorn. 67-78
- A new Recursion Induction PrincipleGérard Boudol. 79-90
- Finite-Change AutomataBurchard von Braunmühl, Rutger Verbeek. 91-100
- Move Rules and Trade-Offs in the Pebble GamePeter van Emde Boas, Jan van Leeuwen. 101-112
- Transition Diagrams and Strict Deterministic GrammarsDietmar Friede. 113-123
- Exact Expressions for some Randomness TestsPéter Gács. 124-131
- On Storage Optimization for Automatically Generated CompilersHarald Ganzinger. 132-141
- On Continuous CompletionsIrène Guessarian. 142-152
- A New Method to Show Lower Bounds for Polynomials which are Hard to ComputeJoos Heintz. 153-157
- On Zerotesting-Bounded Multicounter MachinesMatthias Jantzen. 158-169
- When are two Effectively given Domains Identical?Akira Kanda, David Michael Ritchie Park. 170-181
- Sur deux langages linéairesMichel Latteux. 182-189
- An Efficient On-Line Position Tree Construction AlgorithmMila E. Majster-Cederbaum, Angelika Reiser. 190-198
- Sorting Presorted FilesKurt Mehlhorn. 199-212
- Node-Visit Optimal 1-2 Brother TreesThomas Ottmann, Arnold L. Rosenberg, Hans-Werner Six, Derick Wood. 213-221
- A Graph Theoretic Approach to Determinism versus Non-DeterminismWolfgang J. Paul, Rüdiger Reischuk. 222-232
- Une caractérisation de trois variétés de langages bien connuesJean-Eric Pin. 233-243
- Über eine minimale universelle Turing-MaschineLutz Priese. 244-259
- Sur les variétés de langages et de monoídesChristophe Reutenauer. 260-265
- Automaten in planaren GraphenHans-Anton Rollik. 266-275
- Théorème de transversale rationnelle pour les automates à pile déterministesJacques Sakarovitch. 276-285
- On the Additive Complexity of Polynomials and some New Lower BoundsClaus-Peter Schnorr. 286-297
- Remarks on the Nonexistence of some Covering GrammarsEsko Ukkonen. 298-309
- Zur Komplexität der Presburger Artihmetik und des Äquivalenzproblems einfacher ProgrammeKai Wöhl. 310-318