default search action
Bulletin of the EATCS, Volume 43
Volume 43, February 1991
- Hartmut Ehrig, Helmut Adametz:
New Compatibility Results for Implementations within the Initial Algebraic Approach. Bull. EATCS 43: 102-112 (1991)
- Kevin J. Compton:
Lower Bounds for the Complexity of Theories. Bull. EATCS 43: 113-123 (1991)
- Arto Salomaa:
L Codes and L Systems with Immigration. Bull. EATCS 43: 124-130 (1991)
- David T. Barnard, James P. Schmeiser, David B. Skillicorn:
Associative Operators for Language Recognition. Bull. EATCS 43: 131-138 (1991) - Alberto Bertoni, Paola Campadelli, Giancarlo Mauri:
Some Notes on Computational Learing Theory. Bull. EATCS 43: 140-158 (1991) - Stephen L. Bloom, Zoltán Ésik:
Cayley iff Stone. Bull. EATCS 43: 159-161 (1991) - Nachum Dershowitz, Jean-Pierre Jouannaud:
Notations for Rewting. Bull. EATCS 43: 162-174 (1991) - Robert Giegerich, Enno Ohlebusch:
An Implicit Representation of Infinite Sequences of Terms. Bull. EATCS 43: 174-182 (1991) - Rohit Parikh:
Dumb-Founded Sets. Bull. EATCS 43: 183 (1991) - Iain A. Stewart:
Obtaining Nielsen Reduced Sets in Free Groups. Bull. EATCS 43: 184-188 (1991) - Paulo A. S. Veloso, Sheila R. M. Veloso:
Some Remarks on Conservative Extensions: A Socratic Dialogue. Bull. EATCS 43: 189-198 (1991)
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.