


default search action
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. J. Inf. Process. Cybern. 29(1): 3-8 (1993) - Rainer Kemp:

Random Multidimensional Binary Trees. J. Inf. Process. Cybern. 29(1): 9-36 (1993) - Behnam Pourbabai:

Tandom Behavior of a Random Access Telecommunication System with Repeated Calls. J. Inf. Process. Cybern. 29(1): 37-53 (1993) - Franz Stetter, H. O. van Rooyen:

Program Measures Based on a Graph-Like Model. J. Inf. Process. Cybern. 29(1): 55-76 (1993)
Volume 29, Number 2, 1993
- Thomas Goldberg, Walter Harnau:

On Pseudocirculant Graphs and their Automorphisms. J. Inf. Process. Cybern. 29(2): 79-85 (1993) - Svetlana Loshkaryova:

Some Characteristics of the Graph Information Exchange Systems. J. Inf. Process. Cybern. 29(2): 87-100 (1993) - Keijo Ruohonen:

Undecidability of Event Detection for ODEs. J. Inf. Process. Cybern. 29(2): 101-113 (1993) - Guntram Scheithauer:

Computation of Optimal ø-simple Guillotine Cutting Patterns. J. Inf. Process. Cybern. 29(2): 115-128 (1993) - Dietmar Wätjen:

On Cooperating/Distributed Limited 0L Systems. J. Inf. Process. Cybern. 29(2): 129-142 (1993)
Volume 29, Number 3, 1993
- Klaus D. Heidtmann:

Bewertung der Zuverlässigkeit und Leistung fehlertoleranter Systeme mit Hilfe temporaler Logik. J. Inf. Process. Cybern. 29(3): 145-165 (1993) - Rainer Kemp:

A Note on Two Classes of t-ary Trees. J. Inf. Process. Cybern. 29(3): 167-174 (1993) - Frank Plastria:

A Note on "A Special Problem on Rectangular Floorplans Solvable in Polynomial Time" of G. Bär. J. Inf. Process. Cybern. 29(3): 175-178 (1993) - Behnam Pourbabai:

Approximating Departure Process of a Sigma G/M/1 Queueing System with a Superposition Arrival Process. J. Inf. Process. Cybern. 29(3): 179-191 (1993) - Martin Sonntag:

Hamiltonicity of the Disjunction of Two Hypergraphs. J. Inf. Process. Cybern. 29(3): 193-205 (1993)
Volume 29, Number 4, 1993
- Ismo Hakala:

Efficient Algorithms for Deciding the Morphism Equivalence Problem for Regular, Linear and Context-Free Languages. J. Inf. Process. Cybern. 29(4): 209-213 (1993) - Li Sek Su:

Relationship Between Petri Net Languages' Classes L0 and T0 in the Case of lambda-Nonconsideration. J. Inf. Process. Cybern. 29(4): 215-219 (1993) - Steven D. Pinkerton:

Optimization of Hierarchical Structures. J. Inf. Process. Cybern. 29(4): 221-231 (1993) - Hendrik Schäbe:

Reliability of Used Components. J. Inf. Process. Cybern. 29(4): 233-239 (1993) - János Sztrik, R. Rigo:

On a Closed Communication System with Fast Sources and Operating in Markovian Environments. J. Inf. Process. Cybern. 29(4): 241-246 (1993)
Volume 29, Number 5, 1993
- Henning Fernau:

Adult Languages of Propagating Systems with Restricted Parallelism. J. Inf. Process. Cybern. 29(5): 249-267 (1993) - Gregor Fritz:

Reachability in Random Transition Graphs. J. Inf. Process. Cybern. 29(5): 269-281 (1993) - Günter Hotz:

Search Trees and Search Graphs for Markov Sources. J. Inf. Process. Cybern. 29(5): 283-292 (1993) - J. Brunner, Th. Drescher, Reinhard Pöschel, H. Seidel:

Power algebras: clones and relations. J. Inf. Process. Cybern. 29(5): 293-302 (1993) - Ferucio Laurentiu Tiplea, Cristian Ene:

A Coverability Structure for Parallel Communicating Grammar Systems. J. Inf. Process. Cybern. 29(5): 303-315 (1993) - Uwe Trier:

Compact Random Multidimensional Binary Trees. J. Inf. Process. Cybern. 29(5): 317-329 (1993)
Volume 29, Number 6, 1993
- Matthias Baaz, Christian G. Fermüller, Richard Zach:

Elimination of Cuts in First-order Finite-valued Logics. J. Inf. Process. Cybern. 29(6): 333-355 (1993) - Rudolf Freund, Gheorghe Paun:

One-dimensional matrix array grammars. J. Inf. Process. Cybern. 29(6): 357-374 (1993) - Helmut Jürgensen, Kai Salomaa, Sheng Yu:

Decidability of the Intercode Property. J. Inf. Process. Cybern. 29(6): 375-380 (1993) - Joanna Kowalska:

Final Controlled T0L Languages. J. Inf. Process. Cybern. 29(6): 381-388 (1993) - Gisela Pitsch:

LL(k)-Coupled-Context-Free Grammars. J. Inf. Process. Cybern. 29(6): 389-413 (1993)

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














