default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDActa Cybernetica, Volume 1
Volume 1, Number 1, 1969
- Gabor T. Herman:
Linear regular languages - Part I. 2-12 - Z. M. Hantos:
Ein analog-elektrisches Modell zur Simulation der Lymphokinetik. 13-25 - L. Klukovits:
Some measure problems concerning the retrospective sequential functions. 27-40
Volume 1, Number 2, 1971
- Gabor T. Herman:
Linear regular languages - Part II : The problem of synthesis. 41-56 - I. Pávó:
Generation of the k-trees of a graph. 57-68 - András Ádám, U. Kling:
On the behavior of some cyclically symmetric networks. 69-79 - A. Máté, J. Szücs:
On measure-theoretic problems involving retrospective sequential functions. 81-91 - K. Bellmann, Michael Gössel:
Versuch einer automatentheoretischen Beschreibung von Selektionsprozessen. 93-96 - Ferenc Móricz:
On a minimization algorithm for Boolean functions. 97-103 - András Ádám:
On some generalizations of cyclic networks. 105-119 - Dániel Muszka, Attila Sára:
VIDEC: A universal visual input for digital electronic computers. 121-127
Volume 1, Number 3, 1972
- András Ádám, J. Bagyinszki:
On some enumeration questions concerning trees and tree-type networks. 129-145 - György E. Révész:
Dual pushdown automata and context sensitive grammars. 147-151 - A. Pellionisz:
Computer simulation of the information preprocessing in the input of the cerebellar cortex. 157-169 - Ferenc Forgó:
Cutting plane methods for solving nonconvex programming problems. 171-192 - Annamária G. Varga:
A method for chronological ordering of archeological sites. 193-200
Volume 1, Number 4, 1972
- Rózsa Péter:
Die prinzipielle Ausschaltbarkeit der rekursiven Prozeduren aus der Programmierungsprache Algol 60. 219-231 - János Demetrovics:
On cardinal numbers of sets of precomplete classes in limit-logics (in Russian). 233-239 - B. Papp:
Procédé pour déterminer les formes normales minimales des fonctions booléennes, en utilisant les règles de minimisation de la fonction de coût. 241-250 - Pál Dömösi:
On the semigroup of automaton mappings with finite alphabet. 251-254 - Wilhelm Kämmerer:
Zu den Ungleichungen der Informationstheorie. 255-256 - D. Muszka, E. Vida:
Verkehrskybernetik I: Automatische Bremse. 257-262 - L. Iliev:
Sur des problèmes de formation et de recherche en informatique. 263-271
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 2026-08-09 22:59 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
