Elektronische Informationsverarbeitung und Kybernetik, Band 28

Volume 28, Number 1, 1992

Eberhard Bertsch: Variation of Parsing Speed - a Case Study for Modula-2. 3-20 BibTeX
Margit Voigt: On the Chromatic Number of Distance Graphs. 21-28 BibTeX
Vu Dinh Hoa: Über Hamiltonizität in einer Klasse spezieller Graphen. 29-35 BibTeX
Dietmar Wätjen: A Weak Iteration Theorem for k-limited E0L Systems. 37-40 BibTeX

Daniel Olejár: On the Geometry of a Random Square Boolean Matrix. 47-69 BibTeX
Matti Peltola: A Normal Form for Right Dominating Linear Language. 71-77 BibTeX
Ingo Wegener: How far Can We Count in Constant Depth with a Polylogarithmic Number of Gates? 79-82 BibTeX

Dietlinde Lau: A Completeness Criterion for P_k(l). 87-112 BibTeX
U. Hendrich, Michael Stiebitz: On the Bandwidth of Graph Products. 113-125 BibTeX
Walter Eschenbach: Sequential Fixed-Width Confidence Interval for System Availability. 127-130 BibTeX
Toshinao Nakatsuka, Akihiko Ishikawa: Stochastic Properties of Sharing a Taxi. 131-140 BibTeX

Dietlinde Lau: Ein neuer Beweis für Rosenberg's Vollständigkeitskriterium. 149-195 BibTeX
Ulrike Brandt: Number Representations and Registers. 197-212 BibTeX
Joel Berman, Willem J. Blok: Equational Dependencies. 213-223 BibTeX

Henning Bordihn: Pure Languages and the Degree of Nondeterminism. 231-240 BibTeX
Annegret Habel: Hypergraph Grammars: Transformational and Algorithmic Aspects. 241-277 BibTeX
Kai Salomaa: Confluence, ground confluence, and termination of monadic term rewriting systems. 279-309 BibTeX
Ralf Stiebe: Picture Generation Using Matrix Systems. 311-327 BibTeX

Uwe Ahlfeld, Hans-Dietrich Hecker: The Computational Complexity of some Guard Sets in Polygons. 331-342 BibTeX
Mathias Bull, Armin Hemmerling: Traps for Jumping Multihead Counter Automata. 343-361 BibTeX
Nguyen Xuan Huy, Le Thi Thanh: Generalized Positive Boolean Dependencies. 363-370 BibTeX
Matthias Wentzlau: The Maximum Number of Edges in a Preuniquely k-Colourable Graph with Resistive k-Colourings. 371-383 BibTeX
Jerzy Zurawiecki: The Strong Similitude of Hamiltonian Circuits of a de Bruijn Graph. 385-399 BibTeX