default search action
Bulletin of the EATCS, Volume 33
Volume 33, October 1987
- Herbert Edelsbrunner:
The Computational Geometry Column. Bull. EATCS 33: 23-24 (1987)
- Hartmut Ehrig:
The Algebraic Specification Column. Bull. EATCS 33: 25-26 (1987)
- Juris Hartmanis:
The Structural Complexity Column. Bull. EATCS 33: 26-39 (1987)
- Jan Paredaens:
The Database Theory Column. Bull. EATCS 33: 40-41 (1987)
- Arto Salomaa:
The formal Language Theory Column. Bull. EATCS 33: 42-53 (1987)
- David B. Benson:
Concurrency and interleaving are equally fundamental. Bull. EATCS 33: 54 (1987) - Annegret Habel, Hans-Jörg Kreowski, Walter Vogler:
Complativle graph properties are decidable for hypergraph replacement graph languages. Bull. EATCS 33: 55-61 (1987) - Werner Kuich:
Unampiguous automata. Bull. EATCS 33: 62-66 (1987) - Klaus-Jörn Lange, Michael Schudy:
A further link between formal languages and complexity theory. Bull. EATCS 33: 67-70 (1987) - John-Jules Ch. Meyer:
Process modalities obtained as fixed points (part 2). Bull. EATCS 33: 71-82 (1987) - Edward Ochmanski:
A non-invertible PCF language. Bull. EATCS 33: 83-84 (1987) - Zdzislaw Pawlak:
Decision tables - a rough set approach. Bull. EATCS 33: 85-95 (1987) - Róbert Szelepcsényi:
The moethod of focing for nondeterministic automata. Bull. EATCS 33: 96-99 (1987) - Gerard Tel, Jan van Leeuwen:
A non-deterministic algorithm and its analysis. Bull. EATCS 33: 100-102 (1987) - David Turner:
An overview of Miranda. Bull. EATCS 33: 103-114 (1987)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.