Volume 4,
1980
- Hajnal Andréka, István Németi:
The generalized completeness of Horn predicate-logic as a programming language.
3-10 BibTeX
- Michael A. Arbib, Ernest G. Manes:
Tree transformations and the semantics of loop-free programs.
11-17 BibTeX
- Andrei P. Ershov:
Mixed computation in the class of recursive program schemata.
19-23 BibTeX
- M. A. Gavrilov:
Certain operations with the sets of discrete states.
25-35 BibTeX
- Ferenc Gécseg, Magnus Steinby:
Minimal ascending tree automata.
37-44 BibTeX
- Tamás Gergely, Miklós Szöts:
On the incompleteness of proving partial correctness.
45-57 BibTeX
- Gabor T. Herman, H. K. Liu:
A simple shading for computer displayed surfaces.
59-64 BibTeX
- Günter Hotz:
Normal-form transformations of context-free grammars.
65-84 BibTeX
- A. Iványi, I. Kátai:
Processing of random sequences with priority.
85-101 BibTeX
- Helmut Jürgensen:
Über das Rechnen mit den Elementen abstrakt präsentierter Halbgruppen.
103-115 BibTeX
- W. Kämmerer:
Zur Synthese von DOL-Systemen.
117-121 BibTeX
- Marian Boykan Pour-El, I. Richards:
Differentiability properties of computable functions - a summary.
123-125 BibTeX
- Arto Salomaa:
Equality sets for homomorphisms of free monoid.
127-139 BibTeX
- K. Schütte:
Ein Ansatz zum Entscheidungsverfahren für eine Formelklasse der Prädikatenlogick mit Identität.
141-148 BibTeX
- M. K. Chirkov:
On some types of incompletely specified automata.
151-165 BibTeX
- Z. Zachar:
The solvability of the equivalence problem for deterministic frontier-to-root tree transducers.
167-177 BibTeX
- Z. Laborczi:
A note on deadlocks.
179-184 BibTeX
- Joseph Sifakis:
Use of Petri nets for performance evaluation.
185-202 BibTeX
- Bohdan Zelinka:
Strongly connected digraphs in which each edge is contained in exactly two cycles.
203-205 BibTeX
- Katalin Vesztergombi:
Some remarks on the chromatic number of the strong product of graphs.
207-212 BibTeX
- Hans-Dietrich O. F. Gronau:
On Sperner families in which no 3 sets have an empty intersection.
213-220 BibTeX
- F. Jólesz, M. Szilágyi:
A possible new model of neurons and neural processes based on the quantum-mechanical theory of measurement.
221-239 BibTeX
- A. Békéssy:
Estimation of average length of search on random zero-one matrices.
241-245 BibTeX
- János Demetrovics:
On the equivalence of candidate keys with Sperner systems.
247-252 BibTeX
- Z. Gidófalvy:
A new statistical solution for the deadlock problem in resource management systems.
253-258 BibTeX
- L. K. Bruckner:
On the Garden-of-Eden problem for one-dimensional cellular automata.
259-262 BibTeX
- Endre Katona:
Linear parallel maps of tessellation automata.
263-268 BibTeX
- Ki Hang Kim, Fred W. Roush:
Schützenberger's monoids.
269-272 BibTeX
- János Demetrovics, László Hannák:
The cardinality of closed sets in pre-complete classes in k-valued logic.
273-277 BibTeX
- Hans-Dietrich O. F. Gronau:
Recognition of monotone functions.
279-281 BibTeX
- F. Móricz, A. Varga, P. Ecsedi-Tóth:
A method for minimizing partially defined Boolean functions.
283-290 BibTeX
- K. Tóth:
Modal logics with function symbols.
291-302 BibTeX
- Jürgen Dassow:
On some extensions of Indian parallel context free grammars.
303-310 BibTeX
- L. Csirmaz:
Structure of program runs of non-standard time.
325-331 BibTeX
- Tamás Gergely, László Úry:
Nondeterministic programming within the frame of first order classical logic, Part 1.
333-354 BibTeX
- Tamás Gergely, László Úry:
Nondeterministic programming within the frame of first order classical logic, Part 2.
355-375 BibTeX
- K. Tóth:
Completeness in non-simple and stable modal logics.
377-382 BibTeX
- Ki Hang Kim, Fred W. Roush:
Enumeration of certain words.
383-387 BibTeX
- F. Ferenci:
Groupoids of pseudoautomata.
389-399 BibTeX
Copyright © Sat May 16 23:49:24 2009
by Michael Ley (ley@uni-trier.de)
