Elektronische Informationsverarbeitung und Kybernetik, Band 29

Volume 29, Number 1, 1993

Gisela Härtler, Hendrik Schäbe: Inequalities for Times Between Events Following a Nonhomogeneous Poisson Process. 3-8
Rainer Kemp: Random Multidimensional Binary Trees. 9-36
Behnam Pourbabai: Tandom Behavior of a Random Access Telecommunication System with Repeated Calls. 37-53
Franz Stetter, H. O. van Rooyen: Program Measures Based on a Graph-Like Model. 55-76

Thomas Goldberg, Walter Harnau: On Pseudocirculant Graphs and their Automorphisms. 79-85
Svetlana Loshkaryova: Some Characteristics of the Graph Information Exchange Systems. 87-100
Keijo Ruohonen: Undecidability of Event Detection for ODEs. 101-113
Guntram Scheithauer: Computation of Optimal ø-simple Guillotine Cutting Patterns. 115-128
Dietmar Wätjen: On Cooperating/Distributed Limited 0L Systems. 129-142

Klaus D. Heidtmann: Bewertung der Zuverlässigkeit und Leistung fehlertoleranter Systeme mit Hilfe temporaler Logik. 145-165
Rainer Kemp: A Note on Two Classes of t-ary Trees. 167-174
Frank Plastria: A Note on "A Special Problem on Rectangular Floorplans Solvable in Polynomial Time" of G. Bär. 175-178
Behnam Pourbabai: Approximating Departure Process of a Sigma G/M/1 Queueing System with a Superposition Arrival Process. 179-191
Martin Sonntag: Hamiltonicity of the Disjunction of Two Hypergraphs. 193-205

Ismo Hakala: Efficient Algorithms for Deciding the Morphism Equivalence Problem for Regular, Linear and Context-Free Languages. 209-213
Li Sek Su: Relationship Between Petri Net Languages' Classes L⁰ and T⁰ in the Case of lambda-Nonconsideration. 215-219
Steven D. Pinkerton: Optimization of Hierarchical Structures. 221-231
Hendrik Schäbe: Reliability of Used Components. 233-239
János Sztrik, R. Rigo: On a Closed Communication System with Fast Sources and Operating in Markovian Environments. 241-246

Henning Fernau: Adult Languages of Propagating Systems with Restricted Parallelism. 249-267
Gregor Fritz: Reachability in Random Transition Graphs. 269-281
Günter Hotz: Search Trees and Search Graphs for Markov Sources. 283-292
J. Brunner, Th. Drescher, Reinhard Pöschel, H. Seidel: Power algebras: clones and relations. 293-302
Ferucio Laurentiu Tiplea, Cristian Ene: A Coverability Structure for Parallel Communicating Grammar Systems. 303-315
Uwe Trier: Compact Random Multidimensional Binary Trees. 317-329

Matthias Baaz, Christian G. Fermüller, Richard Zach: Elimination of Cuts in First-order Finite-valued Logics. 333-355
Rudolf Freund, Gheorghe Paun: One-dimensional matrix array grammars. 357-374
Helmut Jürgensen, Kai Salomaa, Sheng Yu: Decidability of the Intercode Property. 375-380
Joanna Kowalska: Final Controlled T0L Languages. 381-388
Gisela Pitsch: LL(k)-Coupled-Context-Free Grammars. 389-413