Bulletin of the EATCS, Volume 39

Volume 39, October 1989

• Joseph A. Goguen: Momories of ADJ. 96-102 BibTeX
• Hartmut Ehrig, Ingo Claßen: Overview of Algebraic Specification Languages Environments and Tools, and Algebraic Specifications of Software Systems. 103-111 BibTeX

• Yuri Gurevich: Logic in Computer Science Column. 112-121 BibTeX

• Ronald V. Book, Osamu Watanabe: A view of structural complexity theory. 122-138 BibTeX

• Domenico Cantone, Vincenzo Cutello: Decision procedures for elementary sublanguages of set theory, XVI, Multilevel syllogistic extended by singleton, rank comparison and unary intersection. 139-148 BibTeX
• Maxime Crochemore: String-matching and periods. 149-153 BibTeX
• Juraj Hromkovic: The knowledge on information content of problems provides much useful information to circuit designers. 154-170 BibTeX
• Aldo de Luca, Stefano Varricchio: A positive pumping condition for regular sets. 171-174 BibTeX
• Zoltán Fülöp, Sándor Vágvölgyi: Congruential tree languages are the same as recognizable tree languages - a proof for a theorem of D. Kozen. 175-184 BibTeX
• Pierre Lescanne: Well quasi-ordering in a paper by Maurice Janet. 185-188 BibTeX
• Alexander Ollongren: A curious grammar. 189-196 BibTeX
• Axel Poigné: Bisimulation as cointersection. 197-198 BibTeX
• Andrzej Skowron: The evidence theory and decision tables. 199-204 BibTeX
• Friedrich J. Urbanek: On minimizing finite automata. 205-206 BibTeX