Elektronische Informationsverarbeitung und Kybernetik, Band 27

Volume 27, Number 1, 1991

Paul Molitor: A Survey on Wiring. 3-19
Henning Fernau: On Function-limited Lindenmayer Systems. 21-53
Ferucio Laurentiu Tiplea, Toader Jucan, Cristian Masalagiu: Conditional Petri Net Languages. 55-66

Jovisa D. Zunic: Inner and Outer Convex Hull Approximation for Finite Planar Point Sets. 75-83
Uwe Wolter: An Algebraic Approach to Deduction in Equational Partial Horn Theories. 85-128
Eckhard Manthei: Domination Theory and Network Reliability Analysis. 129-139

Matthias Wentzlau: Preuniquely k-colourable Graphs and k-colouring Matrices. 151-158
Alexander Meduna: Global Context Conditional Grammars. 159-165
Dietlinde Lau: On Closed Subsets of Boolean Functions (A New Proof for Post's Theorem). 167-178
Martin Kutrib, Roland Vollmar: Minimal Time Synchronization in Restricted Defective Cellular Automata. 179-196

Claudia Leopold: Reading Data in a Hierarchical Memory. 207-216
Joachim Biskup, János Demetrovics, Leonid Libkin, Ilya B. Muchnik: On Relational Database Schemes Having Unique Minimal Key. 217-225
Louchka Popova-Zeugmann: On Time Petri Nets. 227-244
Martin Hartwig, Eckhard Stein, Roland Strobel: Specification and Implementation of a Tree Interface for Ada. 245-255

Guntram Scheithauer: A Three-dimensional Bin Packing Algorithm. 263-271
Reinhard Röpling-Lenhart: A Lower Bound for the Length of Snakes. 273-282
Gunter Bär: A Special Problem on Rectangular Floorplans Solvable in Polynomial Time. 283-288
Martin Sonntag: Hamiltonicity and Traceability of the Lexicographic Product of Hypergraphs. 289-301
Viliam Geffert: How to Generate Languages Using Only Two Pairs of Parentheses. 303-315
Peter Tittmann, Andrea Blechschmidt: Reliability Bounds Based on Network Splitting. 317-326

Sos S. Agaian, Arthur A. Petrosian: On the Relationship between Compression Coefficient, Precision of Reconstruction and Complexity of Calculations. 335-345
David N. Gevorkian: On Subgroup Subcodes of BCH Codes. 347-350
G. H. Khachatrian, H. A. Shamoyan: The Cardinality of Uniquely-decodable Codes for Two-User Adder Channel. 351-355
A. H. Mkhitarian: Multi Asymmetric Error-correcting Code. 373-376
Ludwig Staiger: On Codes having Dual Distance d'>=k. 377-383
Martin Sonntag: Corrigendum to: "Hamiltonicity of the Normal Product of Hypergraphs" in: J. Inform. Process. Cybernet. EIK26(1990) 7, 415-433. 385-386

Heiner Fauck: Covering Polygons with Rectangles via Edge Coverings of Bipartite Permutation Graphs. 391-409
Juraj Hromkovic, Ladislav Janiga, Václav Koubek: Variable Multihead Machines. 411-424
Manfred Koebe: Tolerance Graphs and Trapezoid Graphs. 425-431
Li Sek Su: Relationships Between Classes of Petri Net Language. 433-443