Bulletin of the EATCS, Volume 67

Volume 67, February 1999

The Computational Complexity Column

• 
  Neil Immerman:
  Progress in Descriptive Complexity. Bulletin of the EATCS 67: 72-81 (1999)

Formal Specification Column

• 
  Felix Cornelius:
  An Overview of the Distributed System Classification and Integration Framework DeCIF. Bulletin of the EATCS 67: 82-92 (1999)

The Logic in Computer Science Column

• 
  Yuri Gurevich:
  The Sequential ASM Thesis. Bulletin of the EATCS 67: 93 (1999)

The Natural Computing Column

• 
  Martyn Amos:
  Theoretical and Experimental DNA Computation. Bulletin of the EATCS 67 (1999)

The Formal Language Theory Column

• 
  Gheorghe Paun:
  Computing with Membranes: An Introduction. Bulletin of the EATCS 67: 139-152 (1999)

Technical Contributions

• 
  Misha Koshelev, Vladik Kreinovich, Luc Longpré:
  Encryption Algorithms Made (Somewhat) More Natural (a pedagogical remark). Bulletin of the EATCS 67: 153-156 (1999)
• 
  Andrei Paun:
  On Time-Varying H Systems. Bulletin of the EATCS 67: 157-164 (1999)
• 
  Ion Petre:
  A Normal form for P-Systems. Bulletin of the EATCS 67: 165-172 (1999)
• 
  Gwénaël Richomme:
  Another Characterization of Sturmian Words. Bulletin of the EATCS 67: 173-175 (1999)
• 
  M. Schmidt:
  Time-Bounded Kolmogorov Complexity May Help in Search for Extra Terrestrial Intelligence (SETI). Bulletin of the EATCS 67: 176-180 (1999)
• 
  Y. Yam:
  Reducing the Number of Rules in Intelligent Control: A New Application Area for Algebraic Complexity Techniques. Bulletin of the EATCS 67: 181-184 (1999)