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

Volume 19, Number 3, March 1983

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

Volume 19, Number 4/5, April / May 1983

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

Volume 19, Number 6, June 1983

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

Volume 19, Number 7/8, July / August 1983

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

Volume 19, Number 9, September 1983

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

Volume 19, Number 10/11, October / November 1983

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

Volume 19, Number 12, Dezember 1983

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