Bulletin of the EATCS, Volume 24

Volume 24, October 1984

Technical Contributions

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

Last update Tue Feb 14 03:28:30 2012 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page