Bulletin of the EATCS, Volume 38

Volume 38, June 1989

The Computational Geometry Column

The Algebraic Specification Column

The Logic in Computer Science Column

The Structural Complexity Column

The Formal Language Theory Column

Technical Contributions

André Arnold: Recognizable sets of finite bilabelled transition systems. 123-134
Marek A. Bednarczyk: On minimal finite automata - corrigenda. 135
Gérard Boudol: Atomic actions. 136-144
Ute Brauer, Wilfried Brauer: A new approach to the jeep problem. 145-153
Rob J. van Glabbeek, Ursula Goltz: Parial order semantics for refinement of actions - neither necessary nor always sufficient but appropriate when used with care. 154-163
Wolfgang Golubski, Wolfram-Manfred Lippe: Extensions of top-down tree-to-string transducers. 164-167
Friedhelm Hinz, Jürgen Dassow: A undecidability result for regular anguages and its applications to regulated rewriting. 168-173
C. Jousselin, J.-P. Moskowitz: Memory and algebra. 174-180
Evangelos Kranakis, Lambert G. L. T. Meertens: Optimal packing of similar triangles. 181-185
Maurice Nivat, Andreas Podelski: Definite tree languages. 186-190
Edward Ochmanski: Semi-commutation for P-T Systems. 191-198
Zdzislaw Pawlak: Knowledge, reasoning and classifiaction: A rough set perspective. 199-210
Harrie C. M. de Swart: Improving tablog. 211-218