Acta cybernetica című kiadvány cikkei

Vissza
Export [RSS feed] RSS 1.0 [RSS2 feed] RSS 2.0
Találatok száma: 18.

Békéssy András: Estimation of average length of search on random zero-one matrices. In: Acta cybernetica, (4) 3. pp. 241-245. (1979)

Chirkov M. K.: On some types of incompletely specified automata. In: Acta cybernetica, (4) 2. pp. 151-165. (1979)

Demetrovics János: On the equivalence of candidate keys with Sperner systems. In: Acta cybernetica, (4) 3. pp. 247-252. (1979)

Demetrovics János; Hannák László: The cardinality of closed sets in pre-complete classes in k-valued logics. In: Acta cybernetica, (4) 3. pp. 273-277. (1979)

Gidófalvi Zoltán: A new statistical solution for the deadlock problem in resource management systems. In: Acta cybernetica, (4) 3. pp. 253-258. (1979)

Gronau Hans-Dietrich O. F.: On Sperner families in which no 3 sets have an empty intersection. In: Acta cybernetica, (4) 2. pp. 213-220. (1979)

Gronau Hans-Dietrich O. F.: Recognition of monotone functions. In: Acta cybernetica, (4) 3. pp. 279-281. (1979)

Jólesz Ferenc; Szilágyi M.: A possible new model of neurons and neural processes based on the quantum-mechanical theory of measurement. In: Acta cybernetica, (4) 2. pp. 221-239. (1979)

Kacsukné Bruckner Lívia: On the Garden-of-Eden problem for one-dimensional cellular automata. In: Acta cybernetica, (4) 3. pp. 259-262. (1979)

Katona Endre: Linear parallel maps of tessellation automata. In: Acta cybernetica, (4) 3. pp. 263-268. (1979)

Kim K. H.; Roush Fred William: Schützenberger's monoids. In: Acta cybernetica, (4) 3. pp. 269-272. (1979)

Laborczi Zoltán: A note on deadlocks. In: Acta cybernetica, (4) 2. pp. 179-184. (1979)

Móricz Ferenc; Varga A.; Ecsedi-Tóth Péter: A method for minimizing partially defined Boolean functions. In: Acta cybernetica, (4) 3. pp. 283-290. (1979)

Sifakis J.: Use of Petri nets for performance evaluation. In: Acta cybernetica, (4) 2. pp. 185-202. (1979)

Tóth K.: Modal logics with function symbols. In: Acta cybernetica, (4) 3. pp. 291-302. (1979)

Vesztergombi Katalin: Some remarks on the chromatic number of the strong product of graphs. In: Acta cybernetica, (4) 2. pp. 207-212. (1979)

Zachar Z.: The solvability of the equivalence problem for deterministic frontier-to-root tree transducers. In: Acta cybernetica, (4) 2. pp. 167-177. (1979)

Zelinka B.: Strongly connected digraphs in which each edge is contained in exactly two cycles. In: Acta cybernetica, (4) 2. pp. 203-205. (1979)

A lista elkészítésének dátuma 2024. március 28. 22:50:35 CET.