default search action
Bulletin of the EATCS, Volume 36
Volume 36, October 1988
- Hartmut Ehrig:
The Algebraic Specification Column. Bull. EATCS 36: 52-56 (1988)
- Andreas Blass:
Logic in Computer Ccience Column, guest authors. Bull. EATCS 36: 57-65 (1988)
- Deborah Joseph, Paul Young:
The Structural Complexity Column, guest authors. Bull. EATCS 36: 66-84 (1988)
- Arto Salomaa:
The Formal Language Theory Column. Bull. EATCS 36: 85-95 (1988)
- Peter R. J. Asveld:
On a Post's System of Tag. Bull. EATCS 36: 96-102 (1988) - Helmut Alt, Hubert Wagener:
Approximation of Polygons by Rechtangles and Circles. Bull. EATCS 36: 103-112 (1988) - Marek A. Bednarczyk:
On Minimal Finite Automata. Bull. EATCS 36: 113-115 (1988) - Hans L. Bodlaender:
Some Classes of Graphs with Bounded Treewidth. Bull. EATCS 36: 116-125 (1988) - Juraj Hromkovic:
A candidate for nonlinear lower bound on the combinatorial complexity. Bull. EATCS 36: 126-128 (1988) - Clemens Lautemann:
A note on polynomial interpretation. Bull. EATCS 36: 129-130 (1988) - Maurice Nivat, Ahmed Saoudi:
Automata on infinite trees and Kleene closure of regular tree sets. Bull. EATCS 36: 131-136 (1988) - Patrice Séébold:
An effect solution to the DOL periodicity problem in the binary case. Bull. EATCS 36: 137-151 (1988) - Mikko Tiusanen:
Some unsolved problems in modelling self-timed circuits using Petri nets. Bull. EATCS 36: 152-160 (1988)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.