Bulletin of the EATCS, Volume 33

Volume 33, October 1987

• Herbert Edelsbrunner: The Computational Geometry Column. 23-24 BibTeX

• Hartmut Ehrig: The Algebraic Specification Column. 25-26 BibTeX

• Juris Hartmanis: The Structural Complexity Column. 26-39 BibTeX

• Jan Paredaens: The Database Theory Column. 40-41 BibTeX

• Arto Salomaa: The formal Language Theory Column. 42-53 BibTeX

• David B. Benson: Concurrency and interleaving are equally fundamental. 54 BibTeX
• Annegret Habel, Hans-Jörg Kreowski, Walter Vogler: Complativle graph properties are decidable for hypergraph replacement graph languages. 55-61 BibTeX
• Werner Kuich: Unampiguous automata. 62-66 BibTeX
• Klaus-Jörn Lange, Michael Schudy: A further link between formal languages and complexity theory. 67-70 BibTeX
• John-Jules Ch. Meyer: Process modalities obtained as fixed points (part 2). 71-82 BibTeX
• Edward Ochmanski: A non-invertible PCF language. 83-84 BibTeX
• Zdzislaw Pawlak: Decision tables - a rough set approach. 85-95 BibTeX
• Róbert Szelepcsényi: The moethod of focing for nondeterministic automata. 96-99 BibTeX
• Gerard Tel, Jan van Leeuwen: A non-deterministic algorithm and its analysis. 100-102 BibTeX
• David Turner: An overview of Miranda. 103-114 BibTeX