default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElektronische Informationsverarbeitung und Kybernetik, Band 19
Volume 19, Number 1/2, January / February 1983
- Klemens Döpp:
Zum Hackschen Wohlformungssatz für Free-Choice-Petrinetze. J. Inf. Process. Cybern. 19(1/2): 3-15 (1983) - Jan A. Bergstra, Jan Willem Klop:
Initial Algebra Specifications for Parametrized Data Types. J. Inf. Process. Cybern. 19(1/2): 17-31 (1983) - Gisbert Dittrich, Wolfgang Merzenich:
Operatornets: Their Unfoldments and Coverings. J. Inf. Process. Cybern. 19(1/2): 33-53 (1983) - Hans Kohlhase:
Zum Reduktionsverhalten von Modulautomaten. J. Inf. Process. Cybern. 19(1/2): 55-66 (1983) - Hanns-Martin Teichert:
Hamiltonian Properties of the Lexicographic Product of Undirected Graphs. J. Inf. Process. Cybern. 19(1/2): 67-77 (1983) - Andrzej Szepietowski:
On Searching Plane Labyrinths by 1-Pebble-Automata. J. Inf. Process. Cybern. 19(1/2): 79-84 (1983) - Armin Hemmerling:
D!=ND für mehrdimensionale Turing-Automaten mit sublogarithmischer Raumschranke. J. Inf. Process. Cybern. 19(1/2): 85-94 (1983) - E. V. Krishnamurthy:
Fast Parallel Exact Computation of the Moore-Penrose Inverse and Rank of a Matrix. J. Inf. Process. Cybern. 19(1/2): 95-98 (1983)
Volume 19, Number 3, March 1983
- Klemens Döpp:
Ein Satz über Free-Choice-Petrinetze. J. Inf. Process. Cybern. 19(3): 107-113 (1983) - Lothar Budach, Hans Kohlhase:
Zur Redundanz von Komposita endlicher Automaten. J. Inf. Process. Cybern. 19(3): 115-130 (1983) - Karl Straßner:
Semiautomaten mit K-determinierten Konruenzverbänden. J. Inf. Process. Cybern. 19(3): 131-135 (1983) - Jan Lunze:
Determination of Stabilizing Output Feedback Matrices to Initiate Optimal Control Procedures. J. Inf. Process. Cybern. 19(3): 137-151 (1983)
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. J. Inf. Process. Cybern. 19(4/5): 171-186 (1983) - Karl Weber, Bernd Klipps:
Boolean Functions of Maximum Length and Sperner Type Conditions About the Set of Faces of the n-cube. J. Inf. Process. Cybern. 19(4/5): 187-193 (1983) - Karl Straßner:
1-Kongruenzen unendlicher Relationalsysteme. J. Inf. Process. Cybern. 19(4/5): 195-198 (1983) - Peter H. Starke:
Graph Grammars for Petri Net Processes. J. Inf. Process. Cybern. 19(4/5): 199-233 (1983) - Hans Werner Pohl:
Petri Net Games. J. Inf. Process. Cybern. 19(4/5): 235-244 (1983) - Reinhard Schulze:
Darstellung von nichtauflösbaren impliziten nichtlinearen Differentialgleichungen in Zustandsform und Existenzaussagen über die Lösbarkeit. J. Inf. Process. Cybern. 19(4/5): 245-255 (1983)
Volume 19, Number 6, June 1983
- Helmut Jürgensen, Huei-Jan Shyr, Gabriel Thierrin:
Disjunctive omega-Languages. J. Inf. Process. Cybern. 19(6): 267-278 (1983) - Hans Ulrich Simon:
The Structure of the Monoid (N, X) of Logic Circuits. J. Inf. Process. Cybern. 19(6): 279-296 (1983) - Ulrich L. Hupbach, Horst Reichel:
On Behavioural Equivalence of Data Types. J. Inf. Process. Cybern. 19(6): 297-305 (1983) - Uwe Jansen:
A Generalization of Intensivity Results by Cyclically Marked Stationary Point Processes. J. Inf. Process. Cybern. 19(6): 307-320 (1983)
Volume 19, Number 7/8, July / August 1983
- Kurt Reinschke:
Graphentheoretische Lösung eines Reglerentwurfsproblems. J. Inf. Process. Cybern. 19(7/8): 331-344 (1983) - Hanns-Martin Teichert:
On the Pancyclicity of Some Product Graphs. J. Inf. Process. Cybern. 19(7/8): 345-356 (1983) - Hans-Dietrich O. F. Gronau:
Maximum Nontrivial k-uniform Set Families in Which no µ Sets Have an Empty Intersection. J. Inf. Process. Cybern. 19(7/8): 357-364 (1983) - Karl Weber:
Subcubes of Random Boolean Functions. J. Inf. Process. Cybern. 19(7/8): 365-374 (1983) - Stefan Sujan:
Epsilon-Rates and Noiseless Fixed-Rate Block Coding for Stationary Non-Ergodic Sources. J. Inf. Process. Cybern. 19(7/8): 375-385 (1983) - Peter Enskonatus:
Kopplung zwischen dem kanonischen LR(1)- und dem LALR(1)-Verfahren zur Parsertabellengenerierung. J. Inf. Process. Cybern. 19(7/8): 387-392 (1983) - Dieter Barthel:
Eine Bemerkung zur Minimisierung schaltalgebraischer Ausdrücke beim Vorliegen von DON'T-CARE-Bedingungen. J. Inf. Process. Cybern. 19(7/8): 393-396 (1983) - Phan Dinh Dieu:
Notes on the Recursiveness of Stochastic Languages and on Non-contextfree Stochastic Languages. J. Inf. Process. Cybern. 19(7/8): 397-398 (1983)
Volume 19, Number 9, September 1983
- Walter Knödel:
Über das mittlere Verhalten von on-line-Packungsalgorithmen. J. Inf. Process. Cybern. 19(9): 427-433 (1983) - M. Jankowski, Alicja Smoktunowicz, Henryk Wozniakowski:
A Note on Floating-point Summation of Very Many Terms. J. Inf. Process. Cybern. 19(9): 435-440 (1983) - Ilona Konya, Tamás Szabados:
ESBA2: A Subroutine Package for Solving Elliptic Boundary Value Problems by Small Computers. J. Inf. Process. Cybern. 19(9): 441-448 (1983) - Karl Weber:
Prime Implicants of Random Boolean Functions. J. Inf. Process. Cybern. 19(9): 449-458 (1983) - Efim B. Kinber:
A Note on Limit Identification of c-minimal Indices. J. Inf. Process. Cybern. 19(9): 459-463 (1983) - Hans Ulrich Simon:
Classes of X-functions Reducing Pattern Matching on Nets to Pattern Matching on Forests of Binary Trees. J. Inf. Process. Cybern. 19(9): 465-479 (1983)
Volume 19, Number 10/11, October / November 1983
- Grzegorz W. Wasilkowski:
Inverse Function Problem. J. Inf. Process. Cybern. 19(10/11): 491-496 (1983) - Erkki Mäkinen:
On Certain Properties of Left Szilard Languages. J. Inf. Process. Cybern. 19(10/11): 497-501 (1983) - Oleg G. Taraszow:
Zur Anzahl der kreisfreien Turniere, die Obergraph eines endlichen markierten kreisfreien Digraphen sind. J. Inf. Process. Cybern. 19(10/11): 503-527 (1983) - Karl Weber:
Irredundant Disjunctive Normal Forms of Random Boolean Functions. J. Inf. Process. Cybern. 19(10/11): 529-534 (1983) - Klaus Arndt, Bernd-Michael Kirstein:
An Importance Ranking for Components of Highly Reliable Systems. J. Inf. Process. Cybern. 19(10/11): 535-545 (1983) - Karl-Adolf Zech:
Extending Remarks on the Eustace-Mukhopadhyay Approach to Design Rule Checking of Integrated Circuit Layouts. J. Inf. Process. Cybern. 19(10/11): 547-557 (1983) - Thomas Zeugmann:
A-posteriori Characterizations in Inductive Inference of Recursive Functions. J. Inf. Process. Cybern. 19(10/11): 559-594 (1983)
Volume 19, Number 12, Dezember 1983
- László Szabó:
Interpoloation in Algebras With Doubly Primitive Automorphism Groups. J. Inf. Process. Cybern. 19(12): 603-610 (1983) - Hanns-Martin Teichert:
Connectivity and Hamiltonian Properties of the Disjunction of Undirected Graphs. J. Inf. Process. Cybern. 19(12): 611-623 (1983) - Thomas Zeugmann:
On the Synthesis of Fastest Programs in Inductive Inference. J. Inf. Process. Cybern. 19(12): 625-642 (1983) - Tenko Raykov, Walter Warmuth:
Inequalities for Traffic Characteristics. J. Inf. Process. Cybern. 19(12): 643-649 (1983)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-13 23:54 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
