


default search action
Bulletin of the EATCS, Volume 24
Volume 24, October 1984
- Jean-Michel Autebert, Luc Boasson, Joaquim Gabarró:
Context-free grammars in Greibach normal forms. Bull. EATCS 24: 44-47 (1984) - Tudor Balanescu:
A proof rule for the "it it" generalized control structure. Bull. EATCS 24: 48-52 (1984) - Stephen L. Bloom, Zoltán Ésik:
Some varieties of iteration theories. Bull. EATCS 24: 53-65 (1984) - Max Chochemore:
Linear searching for a square in a word. Bull. EATCS 24: 66-72 (1984) - Juris Hartmanis:
On non-isomorphic NP complete sets. Bull. EATCS 24: 73-77 (1984) - Armin Hemmerling:
A searching algorithm for finite embedded D-graphs with no more than k regions. Bull. EATCS 24: 78-84 (1984) - Colm Ó'Dúnlaing, Chee-Keng Yap:
Counting digraphs and hypergraphs. Bull. EATCS 24: 85-87 (1984) - Peter Padawitz, Martin Wirsing:
Completeness of many-sorted equational logic revisited. Bull. EATCS 24: 88-93 (1984) - Zdzislaw Pawlak:
On rough sets. Bull. EATCS 24: 94-108 (1984) - Bernhard Thalheim:
A compelte axiomatization for full join dependencies in relations. Bull. EATCS 24: 109-114 (1984)

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.