Vol. 4 No. 3 (1979)

Regular articles

• On the Garden-of-Eden problem for one-dimensional cellular automata

  Lívia Kacsukné Bruckner

  259-262

  • PDF

• A method for minimizing partially defined Boolean functions

  Ferenc Móricz, A. Varga, Péter Ecsedi-Tóth

  283-290

  • PDF

• On the equivalence of candidate keys with Sperner systems

  János Demetrovics

  247-252

  • PDF

• The cardinality of closed sets in pre-complete classes in k-valued logics

  János Demetrovics, László Hannák

  273-277

  • PDF

• Linear parallel maps of tessellation automata

  Endre Katona

  263-268

  • PDF

• Modal logics with function symbols

  K. Tóth

  291-302

  • PDF

• A new statistical solution for the deadlock problem in resource management systems

  Zoltán Gidófalvi

  253-258

  • PDF

• Recognition of monotone functions

  Hans-Dietrich O. F. Gronau

  279-281

  • PDF

• Estimation of average length of search on random zero-one matrices

  András Békéssy

  241-245

  • PDF

• Schützenberger's monoids

  K. H. Kim, Fred William Roush

  269-272

  • PDF