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