Bulletin of the EATCS, Volume 37

Volume 37, February 1989

• Herbert Edelsbrunner: The Computation Geometry Column. 109-116

• Juris Hartmanis: The Structural Complexity Column. 117-126

• Jean Berstel: Langford strings are square free. 127-128
• Wilfried Brauer: A remark on a note by M. A. Bednarczyk. 129
• Janusz A. Brzozowski: Minimization by reversal is not new. 130
• Lothar Budach, Ernst-Günter Giessmann, Hubert Grassmann, Bernd Graw, Christoph Meinel, Burkhard Molzan, Uwe Schäfer, Peter Zienicke: Recursive VLSI design theory and application. 131-150
• Ernst L. Leiss: More on minimal finite automata. 151
• Nalinakshi Nirmal, Raghavan Rama: Note on (EOL-EOL) array systems. 152-159
• Mark H. Overmars, Bertha Scholten, Ingrid Vincent: Sets without emtpy convex 6-gons. 160-167
• Peter Padawitz: Can inductive proofs be automated? Part II. 168-174
• Leonid Ya. Rosenblum, Alexandre Yakovlev, Vladimir Yakovlev: A look at concurrency semantics through "lattice glasses". 175-180
• Viorica Sofronie: Formula-handling computer solution of Boolean equations, I. Ring equations. 181-185
• Edith Spaan, Leen Torenvliet, Peter van Emde Boas: Nondeterminism fairness and a fundamental analogy. 186-193