Browse by cikk, tanulmány, mű

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Jump to: 1979
Number of items: 18.

1979

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

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

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

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

Gidófalvi, Zoltán: A new statistical solution for the deadlock problem in resource management systems. 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. Acta cybernetica, (4) 2. pp. 213-220. (1979)

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

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

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

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

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

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

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

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

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

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

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

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

This list was generated on 2020. február 18. 13:10:46 CET.