Elektronische Informationsverarbeitung und Kybernetik, Band 19

Volume 19, Number 1/2, January / February 1983

Klemens Döpp: Zum Hackschen Wohlformungssatz für Free-Choice-Petrinetze. 3-15
Jan A. Bergstra, Jan Willem Klop: Initial Algebra Specifications for Parametrized Data Types. 17-31
Gisbert Dittrich, Wolfgang Merzenich: Operatornets: Their Unfoldments and Coverings. 33-53
Hans Kohlhase: Zum Reduktionsverhalten von Modulautomaten. 55-66
Hanns-Martin Teichert: Hamiltonian Properties of the Lexicographic Product of Undirected Graphs. 67-77
Andrzej Szepietowski: On Searching Plane Labyrinths by 1-Pebble-Automata. 79-84
Armin Hemmerling: D!=ND für mehrdimensionale Turing-Automaten mit sublogarithmischer Raumschranke. 85-94
E. V. Krishnamurthy: Fast Parallel Exact Computation of the Moore-Penrose Inverse and Rank of a Matrix. 95-98

Klemens Döpp: Ein Satz über Free-Choice-Petrinetze. 107-113
Lothar Budach, Hans Kohlhase: Zur Redundanz von Komposita endlicher Automaten. 115-130
Karl Straßner: Semiautomaten mit K-determinierten Konruenzverbänden. 131-135
Jan Lunze: Determination of Stabilizing Output Feedback Matrices to Initiate Optimal Control Procedures. 137-151

Louise Martin, Corina Reischer, Ivo G. Rosenberg: Problèmes de complétude pour les circuits aux éléments avec retard. 171-186
Karl Weber, Bernd Klipps: Boolean Functions of Maximum Length and Sperner Type Conditions About the Set of Faces of the n-cube. 187-193
Karl Straßner: 1-Kongruenzen unendlicher Relationalsysteme. 195-198
Peter H. Starke: Graph Grammars for Petri Net Processes. 199-233
Hans Werner Pohl: Petri Net Games. 235-244
Reinhard Schulze: Darstellung von nichtauflösbaren impliziten nichtlinearen Differentialgleichungen in Zustandsform und Existenzaussagen über die Lösbarkeit. 245-255

Helmut Jürgensen, Huei-Jan Shyr, Gabriel Thierrin: Disjunctive omega-Languages. 267-278
Hans-Ulrich Simon: The Structure of the Monoid (N, X) of Logic Circuits. 279-296
Ulrich L. Hupbach, Horst Reichel: On Behavioural Equivalence of Data Types. 297-305
Uwe Jansen: A Generalization of Intensivity Results by Cyclically Marked Stationary Point Processes. 307-320

Kurt Reinschke: Graphentheoretische Lösung eines Reglerentwurfsproblems. 331-344
Hanns-Martin Teichert: On the Pancyclicity of Some Product Graphs. 345-356
Hans-Dietrich O. F. Gronau: Maximum Nontrivial k-uniform Set Families in Which no µ Sets Have an Empty Intersection. 357-364
Karl Weber: Subcubes of Random Boolean Functions. 365-374
Stefan Sujan: Epsilon-Rates and Noiseless Fixed-Rate Block Coding for Stationary Non-Ergodic Sources. 375-385
Peter Enskonatus: Kopplung zwischen dem kanonischen LR(1)- und dem LALR(1)-Verfahren zur Parsertabellengenerierung. 387-392
Dieter Barthel: Eine Bemerkung zur Minimisierung schaltalgebraischer Ausdrücke beim Vorliegen von DON'T-CARE-Bedingungen. 393-396
Phan Dinh Dieu: Notes on the Recursiveness of Stochastic Languages and on Non-contextfree Stochastic Languages. 397-398

Walter Knödel: Über das mittlere Verhalten von on-line-Packungsalgorithmen. 427-433
M. Jankowski, Alicja Smoktunowicz, Henryk Wozniakowski: A Note on Floating-point Summation of Very Many Terms. 435-440
Ilona Konya, Tamas Szabados: ESBA2: A Subroutine Package for Solving Elliptic Boundary Value Problems by Small Computers. 441-448
Karl Weber: Prime Implicants of Random Boolean Functions. 449-458
Efim B. Kinber: A Note on Limit Identification of c-minimal Indices. 459-463
Hans-Ulrich Simon: Classes of X-functions Reducing Pattern Matching on Nets to Pattern Matching on Forests of Binary Trees. 465-479

Grzegorz W. Wasilkowski: Inverse Function Problem. 491-496
Erkki Mäkinen: On Certain Properties of Left Szilard Languages. 497-501
Oleg G. Taraszow: Zur Anzahl der kreisfreien Turniere, die Obergraph eines endlichen markierten kreisfreien Digraphen sind. 503-527
Karl Weber: Irredundant Disjunctive Normal Forms of Random Boolean Functions. 529-534
Klaus Arndt, Bernd-Michael Kirstein: An Importance Ranking for Components of Highly Reliable Systems. 535-545
R. Karl-Adolf Zech: Extending Remarks on the Eustace-Mukhopadhyay Approach to Design Rule Checking of Integrated Circuit Layouts. 547-557
Thomas Zeugmann: A-posteriori Characterizations in Inductive Inference of Recursive Functions. 559-594

László Szabó: Interpoloation in Algebras With Doubly Primitive Automorphism Groups. 603-610
Hanns-Martin Teichert: Connectivity and Hamiltonian Properties of the Disjunction of Undirected Graphs. 611-623
Thomas Zeugmann: On the Synthesis of Fastest Programs in Inductive Inference. 625-642
Tenko Raykov, Walter Warmuth: Inequalities for Traffic Characteristics. 643-649