Bulletin of the EATCS, Volume 66

Volume 66, October 1998

The Computational Complexity Column

Formal Specification Column

Hartmut Ehrig: EATCS Mini-Track of FM'99. 83-84 BibTeX
Julia Padberg: Classification of Petri Nets Using Adjoint Functors. 85-91 BibTeX

The Concurrency Column

Bent Thomsen, Lone Leth Thomsen: Towards Global Computations Guided by Concurrency Theory. 92-99 BibTeX

The Natural Computing Column

The Formal Language Theory Column

Erzsébet Csuhaj-Varjú, Arto Salomaa: Networks of Language Processors: Parallel Communicating Systems. 122-138 BibTeX

Technical Contributions

Cristian Calude, Elena Calude, Catalina Stefanescu: Computational Complementarity for Mealy Automata. 139-149 BibTeX
Ann Q. Gates, Vladik Kreinovich, Luc Longpré: Kolmogorov Complexity Justifies Software Engineering Heuristics. 150-154 BibTeX
Ekkart Kindler, Michael Weber: The Dimensions of Petri Nets: The Petri Net Cube. 155-165 BibTeX
Misha Koshelev: Towards the Use of Aesthetics in Decision Making: Kolmogorov Complexity Formalizes Birkhoff's Idea. 166-170 BibTeX
Enno Ohlebusch: Modularity of Termination for Disjoint Term Graph Rewrite Systems: A Simple Proof. 171-177 BibTeX
Ludwig Staiger: The Hausdorff Measure of Regular omega-languages is Computable. 178-182 BibTeX