Bulletin of the EATCS, Volume 43

Volume 43, February 1991

• Hartmut Ehrig, Helmut Adametz: New Compatibility Results for Implementations within the Initial Algebraic Approach. 102-112 BibTeX

• Kevin J. Compton: Lower Bounds for the Complexity of Theories. 113-123 BibTeX

• Arto Salomaa: L Codes and L Systems with Immigration. 124-130 BibTeX

• David T. Barnard, James P. Schmeiser, David B. Skillicorn: Associative Operators for Language Recognition. 131-138 BibTeX
• Alberto Bertoni, Paola Campadelli, Giancarlo Mauri: Some Notes on Computational Learing Theory. 140-158 BibTeX
• Stephen L. Bloom, Zoltán Ésik: Cayley iff Stone. 159-161 BibTeX
• Nachum Dershowitz, Jean-Pierre Jouannaud: Notations for Rewting. 162-174 BibTeX
• Robert Giegerich, Enno Ohlebusch: An Implicit Representation of Infinite Sequences of Terms. 174-182 BibTeX
• Rohit Parikh: Dumb-Founded Sets. 183 BibTeX
• Iain A. Stewart: Obtaining Nielsen Reduced Sets in Free Groups. 184-188 BibTeX
• Paulo A. S. Veloso, Sheila R. M. Veloso: Some Remarks on Conservative Extensions: A Socratic Dialogue. 189-198 BibTeX