Bulletin of the EATCS, Volume 36

Volume 36, October 1988

• Hartmut Ehrig: The Algebraic Specification Column. 52-56 BibTeX

• Andreas Blass: Logic in Computer Ccience Column, guest authors. 57-65 BibTeX

• Deborah Joseph, Paul Young: The Structural Complexity Column, guest authors. 66-84 BibTeX

• Arto Salomaa: The Formal Language Theory Column. 85-95 BibTeX

• Peter R. J. Asveld: On a Post's System of Tag. 96-102 BibTeX
• Helmut Alt, Hubert Wagener: Approximation of Polygons by Rechtangles and Circles. 103-112 BibTeX
• Marek A. Bednarczyk: On Minimal Finite Automata. 113-115 BibTeX
• Hans L. Bodlaender: Some Classes of Graphs with Bounded Treewidth. 116-125 BibTeX
• Juraj Hromkovic: A candidate for nonlinear lower bound on the combinatorial complexity. 126-128 BibTeX
• Clemens Lautemann: A note on polynomial interpretation. 129-130 BibTeX
• Maurice Nivat, Ahmed Saoudi: Automata on infinite trees and Kleene closure of regular tree sets. 131-136 BibTeX
• Patrice Séébold: An effect solution to the DOL periodicity problem in the binary case. 137-151 BibTeX
• Mikko Tiusanen: Some unsolved problems in modelling self-timed circuits using Petri nets. 152-160 BibTeX